On the sojourn time distribution in a finite capacity processor shared queue

DOI10.1145/174147.169736zbMath0795.68020OpenAlexW2045512321MaRDI QIDQ4285639

Charles Knessl

Publication date: 24 March 1994

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/174147.169736

zbMATH Keywords

asymptoticssojourn timesM/M/1 queueprocessor-sharing

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (7)

Queueing system with processor sharing and limited memory under control of the AQM mechanism ⋮ Asymptotic Analysis of Spectral Properties of Finite Capacity Processor Shared Queues ⋮ On a processor sharing queue that models balking ⋮ Heavy traffic asymptotics of the queue length in the GI/M/l – K queue ⋮ Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines ⋮ On sojourn times in the finite capacity \(M/M/1\) queue with processor sharing ⋮ Heterogeneous System MMPP/GI(2)/∞ with Random Customers Capacities

This page was built for publication: On the sojourn time distribution in a finite capacity processor shared queue