Heavy-tailed limits for medium size jobs and comparison scheduling

DOI10.1007/s10479-008-0432-0zbMath1169.90366arXiv0805.1968OpenAlexW2592596173MaRDI QIDQ839865

Jian Tan, Xiaozhu Kang, Predrag R. Jelenković

Publication date: 3 September 2009

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

Full work available at URL: https://arxiv.org/abs/0805.1968

zbMATH Keywords

fairnessscalabilityasymptotic analysisheavy tailsM/G/1 queueadaptive thresholdsprocessor sharingcomparison schedulingforeground background processor sharingmedium size jobsshortest remaining processing time first

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Handling load with less stress
• A large-deviations analysis of the GI/GI/1 SRPT queue
• Asymptotic loss probability in a finite buffer fluid queue with heterogeneous heavy-tailed on-off processes
• Sojourn time asymptotics in the \(M/G/1\) processor sharing queue
• Reduced-load equivalence and induced burstiness in GPS queues with long-tailed traffic flows
• Largest weighted delay first scheduling: Large deviations and optimality
• Scheduling strategies and long-range dependence
• Preventing Large Sojourn Times Using SMART Scheduling
• On the tails of waiting-time distributions
• Subexponential asymptotics of a Markov-modulated random walk with queueing applications
• Tail probabilities for non-standard risk and queueing processes with subexponential jumps
• Grouped distributed queues
• On the exact asymptotics of the busy period in GI/G/1 queues
• The Queue M/G/1 with the Shortest Remaining Processing Time Discipline
• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
• Large Deviation Analysis of Subexponential Waiting Times in a Processor-Sharing Queue

This page was built for publication: Heavy-tailed limits for medium size jobs and comparison scheduling