Resource Allocation Schemes for Gang Scheduling
Gang scheduling is currently the most popular scheduling scheme for parallel processing in a time shared environment. In this paper we .rst describe the ideas of job re-packing and workload tree for e.ciently allocating resources to enhance the performance of gang scheduling. We then present some experimental results obtained by implementing four di.erent resource allocation schemes. These results show how the ideas, such as re-packing jobs, running jobs in multiple slots and minimising the average number of time slots in the system, a.ect system and job performance when incorporated into the buddy based allocation scheme for gang scheduling.
Unable to display preview. Download preview PDF.
- 1.A. B. Downey, A parallel workload model and its implications for processor allocation, Proceedings of 6th International Symposium on High Performance Distributed Computing, Aug 1997.Google Scholar
- 2.D. G. Feitelson, Packing schemes for gang scheduling, In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), Lecture Notes Computer Science, Vol. 1162, Springer-Verlag, 1996, pp.89–110.Google Scholar
- 4.D. G. Feitelson and L. Rudolph, Job scheduling for parallel supercomputers, in Encyclopedia of Computer Science and Technology, Vol. 38, Marcel Dekker, Inc, New York, 1998.Google Scholar
- 6.V. Lo, J. Mache and K. Windisch, A comparative study of real workload traces and synthetic workload models for parallel job scheduling, In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (Eds.), Lecture Notes Computer Science, Vol. 1459, Springer-Verlag, 1998, pp.25–46.Google Scholar
- 7.J. K. Ousterhout, Scheduling techniques for concurrent systems, Proceedings of Third International Conference on Distributed Computing Systems, May 1982, pp.20–30.Google Scholar
- 9.J. Skovira, W. Chan, H. Zhou and D. Lifka, The EASY-LoadLeveler API project, In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (Eds.), Lecture Notes Computer Science, Vol. 1162, Springer-Verlag, 1996.Google Scholar
- 10.K. Suzaki, H. Tanuma, S. Hirano, Y. Ichisugi and M. Tukamoto, Time sharing systems that use a partitioning algorithm on mesh-connected parallel computers, Proceedings of the Ninth International Conference on Distributed Computing Systems, 1996, pp.268–275.Google Scholar
- 11.B. B. Zhou, R. P. Brent, C. W. Johnson and D. Walsh, Job repacking for enhancing the performance of gang scheduling, Proceedings of 5th Workshop on Job Scheduling Strategies for Parallel Processing, San Juan, April 1999, pp.129–143.Google Scholar