loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
12th International Conference on Parallel and Distributed Systems - Volume 1 (ICPADS'06)
Dynamic Critical Path Duplication Task Scheduling Algorithm for Distributed Heterogeneous Computing Systems
Minneapolis, Minnesota
July 12-July 15
ISBN: 0-7695-2612-8
Chun-Hsien Liu, National Taichung University, Taiwan
Chia-Feng Li, National Taichung University, Taiwan
Kuan-Chou Lai, National Taichung University, Taiwan
Chao-Chin Wu, National Changhua University of Education, Taiwan
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.
Citation:
Chun-Hsien Liu, Chia-Feng Li, Kuan-Chou Lai, Chao-Chin Wu, "Dynamic Critical Path Duplication Task Scheduling Algorithm for Distributed Heterogeneous Computing Systems," icpads, vol. 1, pp.365-374, 12th International Conference on Parallel and Distributed Systems - Volume 1 (ICPADS'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.