skip to main content
10.1109/ICPADS.2006.40guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

Efficient Compile-Time Task scheduling for Heterogeneous Distributed Computing Systems

Published: 12 July 2006 Publication History

Abstract

Efficient task scheduling is essential for obtaining high performance in heterogeneous distributed computing systems (or HeDCSs). Because of its key importance, several scheduling algorithms have been proposed in the literature, which are mainly for homogeneous processors. Few scheduling algorithms are developed for HeDCSs. In this paper, we present a novel task scheduling algorithm, called the Longest Dynamic Critical Path (LDCP) Algorithm, for HeDCSs. The LDCP algorithm is a list-based scheduling algorithm that uses a new attribute to effectively compute the priorities of tasks in HeDCSs. At each scheduling step, the LDCP algorithm selects the task with the highest priority and assigns the selected task to the processor that minimizes its finish execution time using an insertion-based scheduling policy. The LDCP algorithm successfully generates task schedules that outperform, to the best of our knowledge, two of the best scheduling algorithms for HeDCSs.

References

[1]
H. Topcuoglu, S. Hariri, and M.Y. Wu, "Performance-Effective and Low- Complexity Task Scheduling for Heterogeneous Computing", IEEE Trans. Parallel and Distributed Systems, Vol. 13, No. 3, pp. 260-274, March 2002.
[2]
A. Zomaya, C. Ward, and B. Macey, "Genetic Scheduling for Parallel Processor Systems: Comparative Studies and Performance Issues", IEEE Trans. Parallel and Distributed Systems, Vol. 10, No. 8, pp. 795-812, August 1999.
[3]
S. Bansal, P. Kumar, and K. Singh, "An Improved Duplication Strategy for Scheduling Precedence Constrained Graphs in Multiprocessor systems", IEEE Trans. Parallel and Distributed Systems, Vol. 14, No. 6, pp. 533-544, June 2003.
[4]
Y.K. Kwok and I. Ahmad, "Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors", ACM Computing Surveys, Vol. 31, No. 4, pp. 406-471, December 1999.
[5]
Y.K. Kwok and I. Ahmad, "Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors", IEEE Trans. Parallel and Distributed Systems, Vol. 7, No. 5, pp. 506-521, May 1996.
[6]
A.Y. Zomaya and Y.H. Teh, "Observations on Using Genetic Algorithms for Dynamic Load Balancing", IEEE Trans. Parallel and Distributed Systems, Vol. 12, No. 9, pp. 899-911, September 2001.
[7]
G.C. Sih, and E.A. Lee, "A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures", IEEE Trans. Parallel and Distributed Systems, Vol. 4, No. 2, pp. 175-187, February 1993.
[8]
I. Ahmad and Y.K. Kwok, "On Exploiting Task Duplication in Parallel Program Scheduling", IEEE Trans. Parallel and Distributed Systems, Vol. 9, No. 9, pp. 872- 892, September 1998.
[9]
M. Wu and D. Dajski, "Hypertool: A Programming Aid for Message Passing Systems", IEEE Trans. Parallel and Distributed Systems, Vol. 1, pp. 330-343, July 1990.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings
ICPADS '06: Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
July 2006
640 pages
ISBN:0769526128

Publisher

IEEE Computer Society

United States

Publication History

Published: 12 July 2006

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 06 Jan 2025

Other Metrics

Citations

Cited By

View all

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media