Search arXivSearch

arXiv · 1311.0486

On the optimal tradeoff of average service cost rate, average utility rate, and average delay for the state dependent M/M/1 queue

Abstract

The optimal tradeoff between average service cost rate, average utility rate, and average delay is addressed for a state dependent M/M/1 queueing model, with controllable queue length dependent service rates and arrival rates. For a model with a constant arrival rate $λ$ for all queue lengths, we obtain an asymptotic characterization of the minimum average delay, when the average service cost rate is a small positive quantity, $V$, more than the minimum average service cost rate required for queue stability. We show that depending on the value of the arrival rate $λ$, the assumed service cost rate function, and the possible values of the service rates, the minimum average delay either: a) increases only to a finite value, b) increases without bound as $\log\frac{1}{V}$, c) increases without bound as $\frac{1}{V}$, or d) increases without bound as $\frac{1}{\sqrt{V}}$, when $V \downarrow 0$. We then extend our analysis to (i) a complementary problem, where the tradeoff of average utility rate and average delay is analysed for a M/M/1 queueing model, with controllable queue length dependent arrival rates, but a constant service rate $μ$ for all queue lengths, and (ii) a M/M/1 queueing model, with controllable queue length dependent service rates and arrival rates, for which we obtain an asymptotic characterization of the minimum average delay under constraints on both the average service cost rate as well as the average utility rate. The results that we obtain are useful in obtaining intuition as well guidance for the derivation of similar asymptotic lower bounds, such as the Berry-Gallager asymptotic lower bound, for discrete time queueing models.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vineeth B. S., Utpal Mukherji. 2013-11-03. On the optimal tradeoff of average service cost rate, average utility rate, and average delay for the state dependent M/M/1 queue. https://arxiv.org/abs/1311.0486

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Performance Analysis of Low-Order, GPU-accelerated Finite Element Kernels using Kokkos

We study performance portability for low-order, matrix-free finite element kernels, using the example of a vectorial, variable-coefficient PDE operator originating in geophysical models. Written in Kokkos, the kernel is compared on NVIDIA H100, AMD MI250X, AMD MI300A and Intel PVC Max 1550 GPUs. Owing to its low order and to optimizations that reduce the arithmetic, the kernel has a low arithmetic intensity, so that its performance is determined by how the finite element assembly is mapped onto the memory hierarchy. This is a dimension in which the architectures differ even within one vendor family, causing different performance characteristics. We examine how Kokkos' hierarchical parallelism and shared scratch memory, which are used for the shared degrees of freedom of the conforming discretization, behave on each device. Finally, we show how portability gaps can be narrowed with tuning levers such as the size of the thread groups, the balance between occupancy and register use, and the atomic accumulation strategy at the end of the kernel.

cs.PF

PrefixBench-H100: Characterizing Prefix Reuse and Time-to-First-Token in H100 LLM Serving

Repeated prompt prefixes are increasingly common in LLM serving workloads, appearing in system prompts, templated retrieval-augmented generation pipelines, agent frameworks, and multi-turn conversations. Modern inference runtimes such as vLLM and TensorRT-LLM provide mechanisms for reusing previously computed KV-cache state across requests, yet it remains unclear when prefix reuse materially improves serving performance on contemporary accelerators and when its benefits are limited by scheduling, cache granularity, concurrency, or memory pressure. This paper presents PrefixBench-H100, a reproducible benchmark and measurement framework for characterizing prefix reuse on a single NVIDIA H100. PrefixBench-H100 combines controlled synthetic traces with chat-style and retrieval-style workloads, and evaluates two widely used LLM serving runtimes under matched workload conditions. The benchmark varies shared-prefix length, suffix diversity, request arrival pattern, concurrency, output length, and cache configuration, while collecting time-to-first-token, inter-token latency, end-to-end latency, throughput, cache-hit statistics, GPU memory usage, and selected profiling traces. The goal of PrefixBench-H100 is not to introduce a new caching algorithm, but to expose the practical operating envelope of prefix reuse for H100-class LLM serving. The study identifies the regime where prefix reuse provides substantial first-token latency reductions and the regime where cache pressure erodes them, while showing that cache effectiveness itself is largely insensitive to concurrency and output length; the cross-runtime differences that remain arise above the cache, in the scheduling layer.

cs.PF

Whittle index approach to multi-server scheduling with convex delay costs and impatient customers

We consider the dynamic scheduling problem in a multi-class M/G/N + M queue with convex delay costs and impatient customers that have exponential abandonment times. We apply the Whittle index approach to find a reasonable heuristic solution for this tricky problem. By assuming exponential abandonment times, we are able to make a very straightforward use of the results of the corresponding problem with patient customers presented in Queueing Systems, Vol. 110, Article no. 2, 2026. Our main theoretical achievements are proving that the closed version of the corresponding discrete-time problem is indexable and deriving an explicit expression for the Whittle index. The discrete-time results are utilized to develop the Whittle index policy for the original continuous-time scheduling problem.

cs.PF