Access the full text.
Sign up today, get DeepDyve free for 14 days.
A. Zwart, O. Boxma (1998)
Sojourn time asymptotics in the M/G/1 processor sharing queueQueueing Systems, 35
S. Borst, O. Boxma, R. Nunez-queija, A. Zwart (2003)
The impact of the service discipline on delay asymptoticsPerform. Evaluation, 54
M. S. Squillante, D. D. Yao, L. Zhang (1999)
Web traffic modeling and Web server performance analysisACM SIGMETRICS Performance Evaluation Review, 27
Nunez Queija (2000)
Processor-Sharing Models for Integrated-Services Networks
Mayank Rawat, A. Kshemkalyani (2003)
SWIFT: scheduling in web servers for fast response timeSecond IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003.
V. Anantharam (1999)
Scheduling strategies and long-range dependenceQueueing Systems, 33
L. Schrage, L. Miller (1966)
The Queue M/G/1 with the Shortest Remaining Processing Time DisciplineOper. Res., 14
S. Asmussen, Hanspeter Schmidli, V. Schmidt (1999)
Tail probabilities for non-standard risk and queueing processes with subexponential jumpsAdvances in Applied Probability, 31
Kihong Park, W. Willinger (2000)
Self-Similar Network Traffic and Performance Evaluation
A. Stolyar, K. Ramanan (2001)
LARGEST WEIGHTED DELAY FIRST SCHEDULING: LARGE DEVIATIONS AND OPTIMALITYAnnals of Applied Probability, 11
L. Kleinrock (1976)
Queueing Systems, Volume 2: Computer Applications
R. Wolff (1989)
Stochastic Modeling and the Theory of Queues
R. Cooper (1977)
Queueing systems, volume II: computer applications : By Leonard Kleinrock. Wiley-Interscience, New York, 1976, xx + 549 pp.Computers & Mathematics With Applications, 3
(2009)
Ann Oper Res
Idris Rai, G. Urvoy-Keller, M. Vernon, E. Biersack (2004)
Performance analysis of LAS-based scheduling disciplines in a packet switched network
L. E. Schrage (1968)
A proof of the optimality of the shortest remaining processing time disciplineOperations Research, 16
P. Jelenkovic, A. Lazar (1998)
Subexponential asymptotics of a Markov-modulated random walk with queueing applicationsJournal of Applied Probability, 35
Idris Rai, E. Biersack, G. Urvoy-Keller (2005)
Size-based scheduling to improve the performance of short TCP flowsIEEE Network, 19
A. Pakes (1975)
On the tails of waiting-time distributionsJournal of Applied Probability, 12
P. Jelenkovic, Xiaozhu Kang, Jian Tan (2007)
Adaptive and scalable comparison scheduling
P. Jelenkovic, P. Momcilovic (2003)
Asymptotic loss probability in a finite buffer fluid queue with hetergeneous heavy-tailed on--off processesAnnals of Applied Probability, 13
M. Squillante, D. Yao, Li Zhang (1999)
Web traffic modeling and Web server performance analysisProceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304), 5
L. Schrage (1968)
Letter to the Editor - A Proof of the Optimality of the Shortest Remaining Processing Time DisciplineOper. Res., 16
P. Jelenkovic, P. Momcilovic (2001)
Capacity regions for network multiplexers with heavy-tailed fluid on-off sourcesProceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213), 1
Bogdan Caprita, Jason Nieh, C. Stein (2006)
Grouped distributed queues: distributed queue, proportional share multiprocessor scheduling
S. Borst, O. Boxma, P. Jelenkovic (2003)
Reduced-Load Equivalence and Induced Burstiness in GPS Queues with Long-Tailed Traffic FlowsQueueing Systems, 43
Z. Palmowski, T. Rolski (2006)
On the exact asymptotics of the busy period in GI/G/1 queuesAdvances in Applied Probability, 38
P. Jelenkovic, P. Momcilovic (2003)
Large Deviation Analysis of Subexponential Waiting Times in a Processor-Sharing QueueMath. Oper. Res., 28
A. Wierman, Mor Harchol-Balter (2003)
Classifying scheduling policies with respect to unfairness in an M/GI/1
P. Jelenkovic, P. Momcilovic (2002)
Resource sharing with subexponential distributionsProceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, 3
F. Baccelli, P. Brémaud (2010)
Elements of Queueing Theory: Palm Martingale Calculus and Stochastic Recurrences
Markovian Queues, O. Sharma, Ellis Hor (1992)
Brief review: Stochastic Modeling and the Theory of Queues by Ronald W. Wolfe (Prentice-Hall, 1989), 19
M. Hughes, R. Bartlett (2002)
Performance analysis.Journal of sports sciences, 20 10
N. Bansal, D. Gamarnik (2006)
Handling load with less stressQueueing Systems, 54
M. Nuyens, A. Wierman, B. Zwart (2008)
Preventing Large Sojourn Times Using SMART SchedulingOper. Res., 56
N. Bansal, Mor Harchol-Balter (2001)
Analysis of SRPT scheduling: investigating unfairness
Mor Harchol-Balter, Bianca Schroeder, N. Bansal, Mukesh Agrawal (2003)
Size-based scheduling to improve web performanceACM Trans. Comput. Syst., 21
R. Loynes (1962)
The stability of a queue with non-independent inter-arrival and service timesMathematical Proceedings of the Cambridge Philosophical Society, 58
M. Nuyens, B. Zwart (2005)
A large-deviations analysis of the GI/GI/1 SRPT queueQueueing Systems, 54
We study the conditional sojourn time distributions of processor sharing (PS), foreground background processor sharing (FBPS) and shortest remaining processing time first (SRPT) scheduling disciplines on an event where the job size of a customer arriving in stationarity is smaller than exactly k≥0 out of the preceding m≥k arrivals. Then, conditioning on the preceding event, the sojourn time distribution of this newly arriving customer behaves asymptotically the same as if the customer were served in isolation with a server of rate (1−ρ)/(k+1) for PS/FBPS, and (1−ρ) for SRPT, respectively, where ρ is the traffic intensity. Hence, the introduced notion of conditional limits allows us to distinguish the asymptotic performance of the studied schedulers by showing that SRPT exhibits considerably better asymptotic behavior for relatively smaller jobs than PS/FBPS.
Annals of Operations Research – Springer Journals
Published: Sep 13, 2008
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.