Moldable Task Scheduling in Dynamic SMP Clusters with Communication on the Fly

Dresden, Germany September 07-September 10

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/PCEE.2004.44

International Conference on Parallel ...

	This Article
	PURCHASE ARTICLE: $19 PDF HTML IEEE Xplore Subscribers
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Lukasz Masko Articles by Gregory Mounie Articles by Denis Trystram Articles by Marek Tudruj

	ASCII Text	x
	Lukasz Masko, Gregory Mounie, Denis Trystram, Marek Tudruj, "Moldable Task Scheduling in Dynamic SMP Clusters with Communication on the Fly," Parallel Computing in Electrical Engineering, International Conference on, pp. 59-64, International Conference on Parallel Computing in Electrical Engineering, (PARELEC'04), 2004.

	BibTex	x
	@article{ 10.1109/PCEE.2004.44, author = {Lukasz Masko and Gregory Mounie and Denis Trystram and Marek Tudruj}, title = {Moldable Task Scheduling in Dynamic SMP Clusters with Communication on the Fly}, journal ={Parallel Computing in Electrical Engineering, International Conference on}, volume = {0}, year = {2004}, isbn = {0-7695-2080-4}, pages = {59-64}, doi = {http://doi.ieeecomputersociety.org/10.1109/PCEE.2004.44}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Parallel Computing in Electrical Engineering, International Conference on TI - Moldable Task Scheduling in Dynamic SMP Clusters with Communication on the Fly SN - 0-7695-2080-4 SP59 EP64 A1 - Lukasz Masko, A1 - Gregory Mounie, A1 - Denis Trystram, A1 - Marek Tudruj, PY - 2004 KW - null VL - 0 JA - Parallel Computing in Electrical Engineering, International Conference on ER -

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.

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

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.