Moldable Task Scheduling in Dynamic SMP Clusters with Communication on the Fly
Łukasz Maśko, Grégory Mounié, Denis Trystram, Marek Tudruj · Parallel Computing in Electrical Engineering · 2004
The paper concerns task graph scheduling in parallel programs using the concept of moldable computational tasks for a parallel architecture based on dynamic SMP processor clusters with data transmissions on the fly. The presented algorithm for scheduling parallel program graphs decomposes an initial program graph to sub-graphs, which fulfill the definition of a moldable task. So identified moldable tasks are then scheduled using an algorithm with warranted schedule length.