Abstract
We describe a scheduler based on the microeconomic paradigm for scheduling on-line a set of parallel jobs in a multiprocessor system. In addition to increasing the system throughput and reducing the response time, we consider fairness in allocating system resources among the users, and provide the user with control over the relative performances of his jobs. Every user has a savings account in which he receives money at a constant rate. To run a job, the user creates an expense account for that job to which he transfers money from his savings account. The job uses the funds in its expense account to obtain the system resources it needs. The share of the system resources allocated to the user is directly related to the rate at which the user receives money; the rate at which the user transfers money into a job expense account controls the job's performance.
We prove that starvation is not possible in our model. Simulation results show that our scheduler improves both system and user performances in comparison with two different variable partitioning policies. It is also effective in guaranteeing fairness and providing control over the performance of jobs.
This author was supported by NSF grant CCR-9024954, by U. S. DOE grant DE-FG05-94ER25216, and by NASA Contract NAS1-19480.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. Blazewicz, M. Dror and J. Weglarz, “Mathematical Programming Formulations for Machine Scheduling: A Survey”, European Journal of Operational Research, No. 51, 1991, pp. 283–300.
D. R. Cheriton and K. Harty, “A Market Approach to Operating System Memory Allocation”, URL page: http://www-dsg.stanford.edu/Publications.html, Stanford University.
E. G. Coffman, M. R. Garey, D. S. Johnson, R. E. Tarjan, “Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms”, SIAM Journal of Computing, Vol. 9, No. 4, November 1980, pp. 808–826.
K. E. Drexler and M. S. Miller, “Incentive Engineering for Computational Resource Management”, in [11], pp. 231–266.
D. G. Feitelson, “A Survey of Scheduling in Multiprogrammed Parallel Systems”, Research Report RC 19790, IBM T.J. Watson Research Center, 1994.
D. G. Feitelson and B. Nitzberg, “Job Characteristics of a Production Parallel Scientific Workload on the NASA Ames iPSC/860”, D. G. Feitelson and L. Rudolph (eds.), Lecture Notes in Computer Science, Vol. 949, Springer-Verlag, 1995.
D. Ferguson, Y. Yemini and C. Nikolau, “Microeconomic Algorithms for Load Balancing in Distributed Systems”, Proc. of the 8th International Conference on Distributed Computer Systems, IEEE, 1988, pp. 491–499.
M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San-Francisco, 1979.
R. L. Graham, “Bounds on Multiprocessing Timing Anomalies”, SIAM Journal of Applied Mathematics, Vol. 17, No. 2, March 1969, pp. 416–428.
J. L. Hellerstein, “Achieving Service Rate Objectives with Decay Usage Scheduling,” IEEE Transactions on Software Engineering, Vol. 19, No. 8, August 1993, pp. 813–825.
B. Huberman (ed.), The Ecology of Computation, North-Holland, 1988.
J. Kay and P. Lauder, “A Fair Share Scheduler”, Communication of the ACM, Vol. 31, No. 1, January 1988, pp. 44–45.
S. Majumdar, D. L. Eager, and R. B. Bunt, “Scheduling in Multiprogrammed Parallel Systems”, Proceedings of the 1988 ACM SIGMETRICS Conference on the Measurement and Modeling of Computer Systems, pp. 104–113.
T. W. Malone, R. E. Fikes, K. R. Grant and M. T. Howard, “Enterprise: A Market-Like Task Scheduler for Distributed Computing Environments”, in [11], pp. 177–205.
M. S. Miller and K. E. Drexler, “Markets and Computation: Agoric Open Systems”, in [11], pp. 133–176.
V. K. Naik, S. K. Setia and M. S. Squillante, “Performance Analysis of Job Scheduling in Parallel Supercomputing Environments”, Research Report RC 19138, IBM T.J. Watson Research Center, 1993.
M. G. Norman and P. Thanisch, “Models of Machines and Computation for Mapping in Multicomputers”, ACM Computing Surveys, Vol. 25, No. 3, September 1993, pp. 263–302.
K. S. Trivedi, Probability and Statistics with Reliability, Queuing and Computer Science Applications, Prentice-Hall, 1982.
C. A. Waldspurger, T. Hogg, B. A. Huberman, J. O. Kephart and W. S. Stornetta, “Spawn: A Distributed Computational Economy”, IEEE Transactions on Software Engineering, Vol. 18, No. 2, February 1992, pp. 103–117.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stoica, I., Abdel-Wahab, H., Pothen, A. (1995). A microeconomic scheduler for parallel computers. In: Feitelson, D.G., Rudolph, L. (eds) Job Scheduling Strategies for Parallel Processing. JSSPP 1995. Lecture Notes in Computer Science, vol 949. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60153-8_30
Download citation
DOI: https://doi.org/10.1007/3-540-60153-8_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60153-1
Online ISBN: 978-3-540-49459-1
eBook Packages: Springer Book Archive