The Community for Technology Leaders
Parallel Computing in Electrical Engineering, 2004. International Conference on (2004)
Dresden, Germany
Sept. 7, 2004 to Sept. 10, 2004
ISBN: 0-7695-2080-4
pp: 59-64
Gregory Mounie , IMAG - France
Lukasz Masko , Institute of Computer Science of the Polish Academy of Sciences, Poland
Marek Tudruj , Institute of Computer Science of the Polish Academy of Sciences, Poland; Polish-Japanese Institute of Information Technology, Poland
Denis Trystram , IMAG - France
ABSTRACT
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.
INDEX TERMS
null
CITATION
Gregory Mounie, Lukasz Masko, Marek Tudruj, Denis Trystram, "Moldable Task Scheduling in Dynamic SMP Clusters with Communication on the Fly", Parallel Computing in Electrical Engineering, 2004. International Conference on, vol. 00, no. , pp. 59-64, 2004, doi:10.1109/PCEE.2004.44
99 ms
(Ver 3.3 (11022016))