Towards Flexibility and Scalability in Parallel Job Scheduling

Abstract : Gang scheduling has been widely used as a practical solution to the dynamic parallel job scheduling problem. Parallel tasks of a job are scheduled for simultaneous execution on a partition of a parallel computer. Gang Scheduling has many advantages, such as responsiveness, efficient sharing of resources and ease of programming. However, there are two major problems associated with gang scheduling: scalability and the decision of what to do when a task blocks. In this paper we propose a class of scheduling policies, dubbed Concurrent Gang, that is a generalization of gang-scheduling, and allows for the flexible simultaneous scheduling of multiple parallel jobs with different characteristics. Besides that, scalability in Concurrent Gang is achieved through the use of a global clock that coordinates the gang scheduler among different processors.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01574080
Contributor : Lip6 Publications <>
Submitted on : Friday, August 11, 2017 - 3:22:55 PM
Last modification on : Thursday, March 21, 2019 - 1:00:56 PM

Identifiers

  • HAL Id : hal-01574080, version 1

Citation

Fabricio Alves Barbosa da Silva, Isaac Scherson. Towards Flexibility and Scalability in Parallel Job Scheduling. 11th IASTED International Conference on Parallel and Distributed Computing and Systems, Nov 1999, Cambridge, United States. ⟨hal-01574080⟩

Share

Metrics

Record views

27