International Conference on Parallel Computing in Electrical Engineering, (PARELEC'04)
Moldable Task Scheduling in Dynamic SMP Clusters with Communication on the Fly
Dresden, Germany
September 07-September 10
ISBN: 0-7695-2080-4
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.
Citation:
Lukasz Masko, Gregory Mounie, Denis Trystram, Marek Tudruj, "Moldable Task Scheduling in Dynamic SMP Clusters with Communication on the Fly," parelec, pp.59-64, International Conference on Parallel Computing in Electrical Engineering, (PARELEC'04), 2004