HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

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 metadata

Cited literature [8 references]  Display  Hide  Download

Contributor : Pierre-François Dutot Connect in order to contact the contributor
Submitted on : Wednesday, February 1, 2006 - 6:38:17 PM
Last modification on : Wednesday, May 4, 2022 - 10:42:02 AM
Long-term archiving on: : Saturday, April 3, 2010 - 10:02:24 PM


  • HAL Id : inria-00001079, version 1



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⟩



Record views


Files downloads