ACM Home Page
Please provide us with feedback. Feedback
Proportional-share scheduling in single-server and multiple-server computing systems
Full text PdfPdf (369 KB)
Source ACM SIGMETRICS Performance Evaluation Review archive
Volume 27 ,  Issue 3  (December 1999) table of contents
Pages: 7 - 10  
Year of Publication: 1999
ISSN:0163-5999
Authors
D. H. J. Epema  Faculty of Information Technology and Systems, Delft University of Technology, P.O. Box 356, 2600 AJ Delft, The Netherlands
J. F. C. M. de Jongh  Faculty of Information Technology and Systems, Delft University of Technology, P.O. Box 356, 2600 AJ Delft, The Netherlands
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 12,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/340242.340295
What is a DOI?

ABSTRACT

Proportional Share Scheduling (PSS), which is the allocation of prespecified fractions of a certain resource to different classes of customers, has been studied both in the context of the allocation of network bandwidth and of processors. Much of this work has focused on systems with a single scheduler and when all classes of customers are constantly backlogged. We study the objectives and performance of PSS policies for processor scheduling when these conditions do not hold.



Collaborative Colleagues:
D. H. J. Epema: colleagues
J. F. C. M. de Jongh: colleagues