We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Masko, L. ; Institute of Computer Science of the Polish Academy of Sciences, Poland ; Mounie, G. ; Trystram, D. ; Tudruj, M.

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.

Published in:

Parallel Computing in Electrical Engineering, 2004. PARELEC 2004. International Conference on

Date of Conference:

7-10 Sept. 2004