Scheduling Moldable Tasks for Dynamic {SMP} Clusters in {S}o{C} Technology

Abstract : The paper presents an algorithm for scheduling parallel programs for execution in a parallel architecture based on dynamic SMP processor clusters with data transfers on the fly. The algorithm is based on the concept of moldable computational tasks. First, an initial program graph is decomposed into sub­graphs, which are then treated as moldable tasks. So identified moldable tasks are then scheduled using an algorithm with warranted schedule length.
Complete list of metadatas

Cited literature [8 references]  Display  Hide  Download

https://hal.inria.fr/inria-00001079
Contributor : Pierre-François Dutot <>
Submitted on : Wednesday, February 1, 2006 - 6:38:17 PM
Last modification on : Wednesday, March 13, 2019 - 2:58:27 PM
Long-term archiving on : Saturday, April 3, 2010 - 10:02:24 PM

Identifiers

  • HAL Id : inria-00001079, version 1

Collections

INRIA | IMAG | UGA

Citation

Lukasz Masko, Pierre-François Dutot, Grégory Mounié, Denis Trystram, Marek Tudruj. Scheduling Moldable Tasks for Dynamic {SMP} Clusters in {S}o{C} Technology. Parallel Processing and Applied Mathematics, Sep 2005, Poznan, Poland. ⟨inria-00001079⟩

Share

Metrics

Record views

345

Files downloads

266