A note on comparing response times in the \(M/GI/1/FB\) and \(M/GI/1/PS\) queues

DOI10.1016/S0167-6377(03)00061-0zbMath1135.90328OpenAlexW2085232978WikidataQ56418692 ScholiaQ56418692MaRDI QIDQ1433665

Adam Wierman, Nikhil Bansal, Mor Harchol-Balter

Publication date: 1 July 2004

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(03)00061-0

zbMATH Keywords

Scheduling\(M/G/1\)Sojourn timeResponse timeFeedback (FB)Least attained service (LAS)Processor sharing (PS)Shortest elapsed time (SET)

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (2)

\(M/G/1/MLPS\) compared to \(M/G/1/PS\) ⋮ On the nonoptimality of the foreground-background discipline for IMRL service times

Cites Work

• The Queue M/G/1 with the Shortest Remaining Processing Time Discipline
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on comparing response times in the \(M/GI/1/FB\) and \(M/GI/1/PS\) queues