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

Chun Hsien Liu, Chia Feng Li, Kuan Chou Lai, Chao Chin Wu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

15 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - 12th International Conference on Parallel and Distributed Systems, ICPADS 2006
Pages365-372
Number of pages8
DOIs
Publication statusPublished - 2006 Dec 1
Event12th International Conference on Parallel and Distributed Systems, ICPADS 2006 - Minneapolis, MN, United States
Duration: 2006 Jul 122006 Jul 15

Publication series

NameProceedings of the International Conference on Parallel and Distributed Systems - ICPADS
Volume1
ISSN (Print)1521-9097

Other

Other12th International Conference on Parallel and Distributed Systems, ICPADS 2006
CountryUnited States
CityMinneapolis, MN
Period06-07-1206-07-15

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture

Cite this

Liu, C. H., Li, C. F., Lai, K. C., & Wu, C. C. (2006). A dynamic critical path duplication task scheduling algorithm for distributed heterogeneous computing systems. In Proceedings - 12th International Conference on Parallel and Distributed Systems, ICPADS 2006 (pp. 365-372). [1655682] (Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS; Vol. 1). https://doi.org/10.1109/ICPADS.2006.37