Scheduling moldable {BSP} tasks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2005

Scheduling moldable {BSP} tasks


Our main goal in this paper is to study the scheduling of parallel BSP tasks on clusters of computers. We focus our attention on special characteristics of BSP tasks, which can use less processors than the original required, but with a particular cost model. We discuss the problem of scheduling a batch of BSP tasks on a fixed number of computers. The objective is to minimize the completion time of the last task (makespan). We show that the problem is difficult and present approximation algorithms and heuristics. We finish the paper presenting the results of extensive simulations under different workloads.


Fichier principal
Vignette du fichier
dgkn_jsspp05.pdf (192.61 Ko) Télécharger le fichier

Dates and versions

inria-00001078 , version 1 (01-02-2006)


  • HAL Id : inria-00001078 , version 1


Pierre-François Dutot, Alfredo Goldman, Fabio Kon, Marco Netto. Scheduling moldable {BSP} tasks. 11th Workshop on Job Scheduling Strategies for Parallel Processing, Jun 2005, Cambridge, MA, USA, pp.157--172. ⟨inria-00001078⟩
116 View
231 Download


Gmail Facebook Twitter LinkedIn More