Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article

On the effect of inexact size information in size based policies

Published: 01 December 2006 Publication History

Abstract

Recently, there have been a number of scheduling success stories in computer applications. Across a wide array of applications, the simple heuristic of "prioritizing small jobs" has been used to reduce user response times with enormous success. For instance, variants of Shortest-Remaining-Processing-Time (SRPT) and Preemptive-Shortest-Job-First (PSJF) have been suggested for use in web servers [5, 12], wireless applications [6], and databases [8]. As a result of the attention given to size based policies by computer systems researchers, there has been a resurgence in analytical work studying these policies. However, the policies studied in theory, e.g. SRPT and PSJF, are idealized versions of the policies implemented by practitioners. In particular, the intricacies of computer systems force the use of complex hybrid policies in practice, though these more complex policies are still built around the heuristic of "prioritizing small jobs." Thus, there exists a gap between the results provided by theoretical research and the needs of practitioners. This gap results from three primary disconnects between the model studied in theory and the needs of system designers. First, in designing systems, the goal is not simply to provide small response times; other performance measures are also important. Thus, idealized policies such as SRPT and PSJF are often tweaked by practitioners to perform well on secondary performance measures (e.g. fairness and slowdown) [3, 11, 12]. Second, the overhead involved in distinguishing between an infinite number of different priority classes typically causes system designers to discretize policies such as SRPT and PSJF so that they use only a small number of priority classes (5-10) [5, 11]. Third, in many cases information about the service demands (sizes) of jobs is inexact. For instance, when serving static content, web servers have exact knowledge of the sizes of the files being served, but have inexact knowledge of network conditions. Thus, the web server only has an estimate of the true service demand [7, 12].

References

[1]
N. Bansal. On the average sojourn time under M/M/1/SRPT. Oper. Res. Letters, 22(2):195--200, 2005.
[2]
S. Borst, O. Boxma, R. N. Queija, and B. Zwart. The impact of the service discipline on delay asymptotics. Performance Evaluation, 54:175--206, 2003.
[3]
M. Gong and C. Williamson. Simulation evaluation of hybrid SRPT scheduling policies. In Proc of IEEE MASCOTS, 2004.
[4]
F. Guillemin, P. Robert, and B. Zwart. Tail asymptotics for processor sharing queues. Adv. in Appl. Prob., 36:525--543, 2004.
[5]
M. Harchol-Balter, B. Schroeder, N. Bansal, and M. Agrawal. Implementation of SRPT scheduling in web servers. ACM Transactions on Computer Systems, 21(2), May 2003.
[6]
M. Hu, J. Zhang, and J. Sadowsky. Traffic aided opportunistic scheduling for wireless networks: Algorithms and performance bounds. Comp. Networks, 46(4):505--518, 2004.
[7]
D. Lu, H. Sheng, and P. Dinda. Size-based scheduling policies with inaccurate scheduling information. In Proc. of IEEE Mascots, 2004.
[8]
D. McWherter, B. Schroeder, N. Ailamaki, and M. Harchol-Balter. Priority mechanisms for OLTP and transactional web applications. In Int. Conf on Data Engineering, 2004.
[9]
R. Nunez-Queija. Queues with equally heavy sojourn time and service requirement distributions. Ann. Oper. Res, 113:101--117, 2002.
[10]
M. Nuyens, A. Wierman, and B. Zwart. Preventing large sojourn times using SMART scheduling. Queueing Sys, to appear.
[11]
I. A. Rai, G. Urvoy-Keller, M. Vernon, and E. W. Biersack. Performance modeling of LAS based scheduling in packet switched networks. In Proc. of ACM Sigmetrics-Performance, 2004.
[12]
M. Rawat and A. Kshemkalyani. SWIFT: Scheduling in web servers for fast response time. In Symp. on Net. Comp. and App., 2003.
[13]
L. E. Schrage. A proof of the optimality of the shortest remaining processing time discipline. Operations Research, 16:678--690, 1968.
[14]
A. Wierman and M. Harchol-Balter. Classifying scheduling policies with respect to unfairness in an M/GI/1. In Proceedings of ACM Sigmetrics, 2003.
[15]
A. Wierman, M. Harchol-Balter, and T. Osogami. Nearly insensitive bounds on SMART scheduling. In Proc. of ACM Sigmetrics, 2005.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGMETRICS Performance Evaluation Review
ACM SIGMETRICS Performance Evaluation Review  Volume 34, Issue 3
December 2006
62 pages
ISSN:0163-5999
DOI:10.1145/1215956
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 2006
Published in SIGMETRICS Volume 34, Issue 3

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 85
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 01 Nov 2024

Other Metrics

Citations

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media