By Topic

Analysis of macro-dataflow dynamic scheduling on nonuniform memory access architectures

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

1 Author(s)
Al-Mouhamed, M. ; Dept. of Comput. Eng., King Fahd Univ. of Petrol. & Min., Dhahran, Saudi Arabia

The author studies dynamic scheduling of computational tasks with communication costs using nonuniform memory access architecture. The computing model assumes that data transfer can be partitioned into parallel and sequential parts with respect to the task execution. A scheduling heuristic, called least-communication (LC), together with a two-level scheduler is proposed in an attempt to minimize the finish time. The LC selects the task that removes the largest amount of remaining data transfer, if no such tasks are available the task that has been ready to run at the earliest is selected first. The time complexity of LC is O(n2). Testing the finish time of LC and first-come first-served scheduling (FCFS) shows that LC is useful for tasks having moderate granularity and whose computation and communication requirements vary widely for different data sets

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:4 ,  Issue: 8 )