Recent sojourn time results for multilevel processor‐sharing scheduling disciplines

DOI10.1111/J.1467-9574.2008.00393.XzbMath1146.60072OpenAlexW2105849850MaRDI QIDQ3525723

Samuli Aalto, Urtzi Ayesta

Publication date: 18 September 2008

Published in: Statistica Neerlandica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1467-9574.2008.00393.x

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

On the Gittins index in the M/G/1 queue ⋮ Approximately optimal scheduling of an \(\mathrm{M}/\mathrm{G}/1\) queue with heavy tails

Cites Work

• Processor-sharing queues: Some progress in analysis
• Mathematical problems in the theory of processor-sharing queueing systems
• Batch arrival processor-sharing with application to multi-level processor-sharing scheduling
• On the nonoptimality of the foreground-background discipline for IMRL service times
• Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful Departures
• On extremal service disciplines in single-stage queueing systems
• Asymptotic convergence of scheduling policies with respect to slowdown
• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Recent sojourn time results for multilevel processor‐sharing scheduling disciplines