By Topic

Dynamic scheduling of nested loops with uniform dependencies in heterogeneous networks of workstations

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
$33 $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

2 Author(s)
I. Riakiotakis ; Dept. of Electr. & Comput. Eng., Nat. Tech. Univ. of Athens, Greece ; P. Tsanakas

Static algorithms have been proposed to parallelize loops with uniform dependencies for networks of workstations. However, the heterogeneous and dynamic nature of these networks demands a dynamic solution to the scheduling and load balancing problem. At the same time many dynamic scheduling algorithms have been proposed, but all of them are dealing with programs with parallel loops, i.e. loops without dependencies. In this paper we extend the applicability of dynamic algorithms by presenting a dynamic scheduling algorithm that uses simple data structures in order to handle programs with data dependencies. Experimental results validate the proposed algorithm in both homogeneous and heterogeneous networks.

Published in:

8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05)

Date of Conference:

7-9 Dec. 2005