Parallel Computing in Electrical Engineering, 2004. International Conference on (2004)
Sept. 7, 2004 to Sept. 10, 2004
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PCEE.2004.44
Lukasz Masko , Institute of Computer Science of the Polish Academy of Sciences, Poland
Gregory Mounie , IMAG - France
Denis Trystram , IMAG - France
Marek Tudruj , Institute of Computer Science of the Polish Academy of Sciences, Poland; Polish-Japanese Institute of Information Technology, Poland
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.
G. Mounie, L. Masko, M. Tudruj and D. Trystram, "Moldable Task Scheduling in Dynamic SMP Clusters with Communication on the Fly," Parallel Computing in Electrical Engineering, 2004. International Conference on(PARELEC), Dresden, Germany, 2004, pp. 59-64.