Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Heavy-tailed limits for medium size jobs and comparison scheduling

Heavy-tailed limits for medium size jobs and comparison scheduling 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Annals of Operations Research Springer Journals

Heavy-tailed limits for medium size jobs and comparison scheduling

Loading next page...
 
/lp/springer-journals/heavy-tailed-limits-for-medium-size-jobs-and-comparison-scheduling-URKnJ53OZW

References (39)

Publisher
Springer Journals
Copyright
Copyright © 2008 by Springer Science+Business Media, LLC
Subject
Business and Management; Operation Research/Decision Theory; Combinatorics; Theory of Computation
ISSN
0254-5330
eISSN
1572-9338
DOI
10.1007/s10479-008-0432-0
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

Annals of Operations ResearchSpringer Journals

Published: Sep 13, 2008

There are no references for this article.