Proportional-share scheduling in single-server and multiple-server computing systems

Authors:
D. H. J. Epema;J. F. C. M. de Jongh
Affiliations:
Faculty of Information Technology and Systems, Delft University of Technology, P.O. Box 356, 2600 AJ Delft, The Netherlands;Faculty of Information Technology and Systems, Delft University of Technology, P.O. Box 356, 2600 AJ Delft, The Netherlands
Venue:
ACM SIGMETRICS Performance Evaluation Review
Year:
1999

Citing 4
Cited 2

Optimal probabilistic allocation of customer types to servers

Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Decay-usage scheduling in multiprocessors

ACM Transactions on Computer Systems (TOCS)
Optimal stochastic scheduling in multiclass parallel queues

SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Comparison of Fair Queuing Algorithms with a Stochastic Approach

MASCOTS '98 Proceedings of the 6th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems

Performing real-time image processing on distributed computer systems

MUSP'10 Proceedings of the 10th WSEAS international conference on Multimedia systems & signal processing
Parallel image and video processing on distributed computer systems

WSEAS Transactions on Signal Processing

Quantified Score

Hi-index	0.00

Visualization

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.