Comparing FB and PS scheduling policies
- 1 December 2006
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 34 (3) , 18-20
- https://doi.org/10.1145/1215956.1215965
Abstract
In this paper we obtain new results concerning the expected response time of the foreground-background (FB) scheduling discipline and its comparison with processor sharing (PS). Some results previously derived for job sizes with finite second moment or bounded sizes, are extended to infinite second moments. New bounds and asymptotic results are also derived. We show that for job sizes with infinite second moment large jobs may benefit from the FB scheduling discipline although this discipline favors short jobs. For certain distributions all jobs sizes may even benefit from FB with respect to PS showing that the performance benefits obtained by some job sizes need not be obtained at the expense of others.Keywords
This publication has 8 references indexed in Scilit:
- The impact of the service discipline on delay asymptoticsPerformance Evaluation, 2003
- Classifying scheduling policies with respect to unfairness in an M/GI/1Published by Association for Computing Machinery (ACM) ,2003
- Analysis of LAS scheduling for job size distributions with high variancePublished by Association for Computing Machinery (ACM) ,2003
- Elements of Queueing TheoryPublished by Springer Nature ,2003
- Asymptotic convergence of scheduling policies with respect to slowdownPerformance Evaluation, 2002
- Queues with Equally Heavy Sojourn Time and Service Requirement DistributionsAnnals of Operations Research, 2002
- Analysis of SRPT schedulingPublished by Association for Computing Machinery (ACM) ,2001
- Technical Note—Distribution of Attained and Residual Service in General Queuing SystemsOperations Research, 1974