Formalizing SMART scheduling

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Formalizing SMART scheduling

Full text

Pdf (1.01 MB)

Source

ACM SIGMETRICS Performance Evaluation Review archive
Volume 32 , Issue 2 (September 2004) table of contents

SPECIAL ISSUE: Sixth Workshop on MAthematical performance Modeling and Analysis (MAMA 2004) table of contents

Pages: 12 - 13

Year of Publication: 2004

ISSN:0163-5999

Authors

Adam Wierman	Carnegie Mellon University
Mor Harchol-Balter	Carnegie Mellon University

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 2, Citation Count: 0

Additional Information:

abstract references collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1035334.1035340 What is a DOI?

ABSTRACT

It is well-known that policies which bias towards small job sizes or jobs with small remaining service times perform well with respect to mean response time and mean slowdown. This idea has been fundamental in many system implementations including the case of Web servers, where it has been shown that by giving priority to requests for small files, a Web server can significantly reduce mean response time and mean slowdown [1]. The heuristic has also been applied to other application areas; for example, scheduling in supercomputing centers.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Mor Harchol-Balter , Bianca Schroeder , Nikhil Bansal , Mukesh Agrawal, Size-based scheduling to improve web performance, ACM Transactions on Computer Systems (TOCS), v.21 n.2, p.207-233, May 2003 [doi>10.1145/762483.762486]
	2	L. Kleinrock. Queueing Systems, volume II. Computer Applications. John Wiley & Sons, 1976.
	3	L. E. Schrage. A proof of the optimality of the shortest remaining processing time discipline. Operations Research, 16:678--690, 1968.
	4	L. E. Schrage and L. W. Miller. The queue M/G/I with the shortest remaining processing time discipline. Operations Research, 14:670--684, 1966.
	5	A. Wierman and M. Harchol-Balter. Bounding the performance of SMART scheduling policies. Technical Report CMU-CS-03-199, Carnegie Mellon University, 2003.

Collaborative Colleagues:

Adam Wierman: colleagues

Mor Harchol-Balter: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player