J. Barbosa, C. Morais, and A.P. Monteiro (Portugal)
Scheduling, parallel/malleable tasks, heterogeneous clus ters.
Parallel tasks, also called malleable tasks, are tasks that can be executed on any number of processors with its execution time being a function of the number of processors alloted to it. The scheduling of independent parallel tasks on homo geneous machines is a problem that has been extensively studied. For heterogeneous machines, with a diverse CPU capacity, new challenges arise, namely the selection of the set of CPUs that optimizes the processing time of a given task. This paper presents a methodology to determine the best allotment for each task that minimizes its processing time on a given heterogeneous machine. The aim is to im prove the global processing time of a complex algorithm composed by several linear algebra kernels, by scheduling a number of parallel tasks in the heterogeneous machine. The results presented compare this approach to the simpler data parallel execution of each task on the heterogeneous cluster, i.e. executing one task at a time using the data par allel programming model.
Important Links:
Go Back
