Response times in M/M/1 time-sharing schemes with limited number of service positions
From MaRDI portal
Publication:3802367
DOI10.2307/3213986zbMath0655.60085OpenAlexW4245301736MaRDI QIDQ3802367
Benjamin Avi-Itzhak, Shlomo Halfin
Publication date: 1988
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/3213986
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (8)
Asymptotic Analysis of Spectral Properties of Finite Capacity Processor Shared Queues ⋮ Approximations and Optimal Control for State-Dependent Limited Processor Sharing Queues ⋮ A single server queue with gated processor-sharing discipline ⋮ Mathematical problems in the theory of processor-sharing queueing systems ⋮ Performance analysis of a multiprogramming-multiprocessor retrial queueing system with orderly reattempts ⋮ Diffusion limits of limited processor sharing queues ⋮ Steady state approximations of limited processor sharing queues in heavy traffic ⋮ Response times in gated M/G/1 queues: The processor-sharing case
This page was built for publication: Response times in M/M/1 time-sharing schemes with limited number of service positions