By Topic

A dynamic critical path duplication task scheduling algorithm for distributed heterogeneous computing systems

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)

This paper proposes a compiler-time scheduling algorithm, called the dynamic critical path duplication (DCPD) scheduling algorithm, to exploit all of a program's available parallelism in distributed heterogeneous computing systems. This algorithm could exploit the potential of parallel processing, allowing for system heterogeneities and network bandwidth. It is compared favorably with other related proposed algorithms. Experimental results show its superiority

Published in:

Parallel and Distributed Systems, 2006. ICPADS 2006. 12th International Conference on  (Volume:1 )

Date of Conference:

0-0 0