Is tail-optimal scheduling possible?

DOI10.1287/OPRE.1120.1086zbMATH Open1257.90028OpenAlexW2141510310MaRDI QIDQ4904587FDOQ4904587

Authors: Adam Wierman, Bert Zwart 

Publication date: 30 January 2013

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

Full work available at URL: https://resolver.caltech.edu/CaltechAUTHORS:20121221-104528945

Recommendations

• Approximately optimal scheduling of an \(\mathrm{M}/\mathrm{G}/1\) queue with heavy tails
• Preventing Large Sojourn Times Using SMART Scheduling
• Heavy-tailed limits for medium size jobs and comparison scheduling
• Large deviations and the generalized processor sharing scheduling for a two-queue system
• Large deviations of sojourn times in processor sharing queues

zbMATH Keywords

large deviationscompetitive analysis

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36)

Cited In (7)

• Heavy-tailed limits for medium size jobs and comparison scheduling
• Instability of sharing systems in the presence of retransmissions
• Approximately optimal scheduling of an \(\mathrm{M}/\mathrm{G}/1\) queue with heavy tails
• On competitive analysis for polling systems
• Achievable performance of blind policies in heavy traffic
• Preventing Large Sojourn Times Using SMART Scheduling
• Taming tail latency in key-value stores: a scheduling perspective

This page was built for publication: Is tail-optimal scheduling possible?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4904587)