Scheduling of MPI Applications: Self-co-scheduling

12 years 11 months ago
Scheduling of MPI Applications: Self-co-scheduling
Scheduling parallel jobs has been an active investigation area. The scheduler has to deal with heterogeneous workloads and try to obtain throughputs and response times such that ensures good performance. We propose a Dynamic Space-Sharing Scheduling technique, the Self Co-Scheduling, based on the combination of the best benefits from Static Space Sharing and Co-Scheduling. A job is allocated a processors partition where its number of processes can be greater than the number of processors. As MPI jobs aren’t malleable, we make the job contend with itself for the use of processors applying Co-Scheduling. The goal of this paper is to evaluate and compare the impact of contending for resources among jobs and with the job itself. We demonstrate that our Self Co-Scheduling technique has better performance and stability than other Time Sharing Scheduling techniques, especially when working with high communication degree workloads, heavy loaded machines and high multiprogramming level.
Gladys Utrera, Julita Corbalán, Jesú
Added 01 Jul 2010
Updated 01 Jul 2010
Type Conference
Year 2004
Authors Gladys Utrera, Julita Corbalán, Jesús Labarta
Comments (0)