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 language | English |
|---|---|
| Title of host publication | Proceedings - 12th International Conference on Parallel and Distributed Systems, ICPADS 2006 |
| Pages | 365-372 |
| Number of pages | 8 |
| DOIs | |
| Publication status | Published - 2006 Dec 1 |
| Event | 12th International Conference on Parallel and Distributed Systems, ICPADS 2006 - Minneapolis, MN, United States Duration: 2006 Jul 12 → 2006 Jul 15 |
Publication series
| Name | Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS |
|---|---|
| Volume | 1 |
| ISSN (Print) | 1521-9097 |
Other
| Other | 12th International Conference on Parallel and Distributed Systems, ICPADS 2006 |
|---|---|
| Country | United States |
| City | Minneapolis, MN |
| Period | 06-07-12 → 06-07-15 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Hardware and Architecture
Cite this
}
A dynamic critical path duplication task scheduling algorithm for distributed heterogeneous computing systems. / Liu, Chun Hsien; Li, Chia Feng; Lai, Kuan Chou; Wu, Chao Chin.
Proceedings - 12th International Conference on Parallel and Distributed Systems, ICPADS 2006. 2006. p. 365-372 1655682 (Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS; Vol. 1).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
TY - GEN
T1 - A dynamic critical path duplication task scheduling algorithm for distributed heterogeneous computing systems
AU - Liu, Chun Hsien
AU - Li, Chia Feng
AU - Lai, Kuan Chou
AU - Wu, Chao Chin
PY - 2006/12/1
Y1 - 2006/12/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=34047208112&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=34047208112&partnerID=8YFLogxK
U2 - 10.1109/ICPADS.2006.37
DO - 10.1109/ICPADS.2006.37
M3 - Conference contribution
AN - SCOPUS:34047208112
SN - 0769526128
SN - 9780769526126
T3 - Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS
SP - 365
EP - 372
BT - Proceedings - 12th International Conference on Parallel and Distributed Systems, ICPADS 2006
ER -