Scheduling on unspecified heterogeneous distributed resources

Daniel Millot (1) , Christian Parrot (1)

1 TSP - INF - Département Informatique

In this paper, we present an adaptive method for scheduling parallel applications on unspecified distributed memory platforms. The presented method can be used to schedule parallel applications when the total workload and the execution parameters (communication speed, available computing power...) are unspecified. When used to schedule divisible load applications according to a master worker model, this method delivers the workload through multiple rounds. In order to maximize the throughput of each worker, it can prevent both idleness in the use of workers and contentions in the use of the links between master and workers. Before focusing on the proposed scheduling method, the paper recalls the underlying methods on which its development relies. The paper then gives a theoretical analysis of the method before presenting results of simulations obtained with the Sim Grid framework on a limited distributed memory platform.

Mots clés: Parallel application; Multi-round divisible load scheduling; Heterogeneous platform; Adaptive scheduling; Unspecified distributed memory platform

Domaines: Calcul parallèle, distribué et partagé [cs.DC]

Daniel Millot, Christian Parrot. Scheduling on unspecified heterogeneous distributed resources. IPDPS 2011 : IEEE International Symposium on Parallel and Distributed Processing, May 2011, Shanghai, China. pp.45 - 56, ⟨10.1109/IPDPS.2011.126⟩. ⟨hal-01298136⟩