Skip to Main content Skip to Navigation
Conference papers

Scheduling moldable {BSP} tasks

Pierre-François Dutot 1 Alfredo Goldman 2 Fabio Kon 2 Marco Netto 2
1 APACHE - Parallel algorithms and load sharing
ID-IMAG - Informatique et Distribution, Inria Grenoble - Rhône-Alpes, UJF - Université Joseph Fourier - Grenoble 1
Abstract : 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.
Keywords : Scheduling BSP Moldable
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download

https://hal.inria.fr/inria-00001078
Contributor : Pierre-François Dutot <>
Submitted on : Wednesday, February 1, 2006 - 6:42:59 PM
Last modification on : Tuesday, February 9, 2021 - 3:22:08 PM
Long-term archiving on: : Saturday, April 3, 2010 - 8:13:03 PM

Identifiers

  • HAL Id : inria-00001078, version 1

Collections

INRIA | IMAG | CNRS | UGA

Citation

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⟩

Share

Metrics

Record views

307

Files downloads

441