Article

A Near Lower-Bound Complexity Algorithm for Compile-Time Task-Scheduling in Heterogeneous Computing Systems

Authors:

ISPDC '04: Proceedings of the Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks

Pages 106 - 113

Published: 05 July 2004 Publication History

Publisher Site

Abstract

Task scheduling is in general an NP-complete problem. For this reason a huge number of heuristics have been presented in the literature to obtain near optimal schedules. These heuristics mainly target homogeneous computing systems, while a few of them target heterogeneous systems. The heterogeneous heuristics presented so far target computing machines with different capabilities, while almost none of them handle heterogeneous communication systems. This paper presents a novel task scheduling algorithm called the Heterogeneous Critical Tasks Reverse Duplicator (HCTRD), which targets both heterogeneous computation and communication systems. The algorithm is based on list-scheduling and task-duplication in a bounded number of machines, and aims to achieve high performance and near lower bound complexity.

Cited By

View all

Hosseinzadeh MShahhoseini H(2009)Earliest starting and finishing time duplication-based algorithmProceedings of the 12th international conference on Symposium on Performance Evaluation of Computer & Telecommunication Systems10.5555/1688291.1688300(49-56)Online publication date: 13-Jul-2009
https://dl.acm.org/doi/10.5555/1688291.1688300
Hsu CChen TLi K(2007)Performance effective pre-scheduling strategy for heterogeneous grid systems in the master slave paradigmFuture Generation Computer Systems10.5555/1224816.122517523:4(569-579)Online publication date: 1-May-2007
https://dl.acm.org/doi/10.5555/1224816.1225175
Lai KLee CFang J(2006)A critical predecessor duplication scheduling algorithm for distributed heterogeneous computing environmentsProceedings of the 5th WSEAS international conference on Telecommunications and informatics10.5555/1974762.1974863(517-522)Online publication date: 27-May-2006
https://dl.acm.org/doi/10.5555/1974762.1974863
Show More Cited By

A Near Lower-Bound Complexity Algorithm for Compile-Time Task-Scheduling in Heterogeneous Computing Systems
1. Computer systems organization
  1. Architectures
    1. Other architectures
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Machine learning theory
      1. Reinforcement learning

Recommendations

An Approach to Compile-Time Task Scheduling in Heterogeneous Computing Systems
ICPPW '04: Proceedings of the 2004 International Conference on Parallel Processing Workshops

List-based scheduling is generally accepted as an attractive approach to static task scheduling since it combines low complexity with good results. Although a large number of scheduling heuristics have been presented in the literature, most of them ...
A Dynamic Matching and Scheduling Algorithm for Heterogeneous Computing Systems
HCW '98: Proceedings of the Seventh Heterogeneous Computing Workshop

A heterogeneous computing system provides a variety of different machines, orchestrated to perform an application whose subtasks have diverse execution requirements. The subtasks must be assigned to machines (matching) and ordered for execution (...
Scheduling directed a-cyclic task graphs on a bounded set of heterogeneous processors using task duplication

In a distributed computing environment, the schedule by which tasks are assigned to processors is critical to minimizing the overall run-time of the application. However, the problem of discovering the schedule that gives the minimum finish time is NP-...

Comments

Information & Contributors

Information

Published In

July 2004

375 pages

ISBN:0769522106

Publisher

IEEE Computer Society

United States

Publication History

Published: 05 July 2004

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 26 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Hosseinzadeh MShahhoseini H(2009)Earliest starting and finishing time duplication-based algorithmProceedings of the 12th international conference on Symposium on Performance Evaluation of Computer & Telecommunication Systems10.5555/1688291.1688300(49-56)Online publication date: 13-Jul-2009
https://dl.acm.org/doi/10.5555/1688291.1688300
Hsu CChen TLi K(2007)Performance effective pre-scheduling strategy for heterogeneous grid systems in the master slave paradigmFuture Generation Computer Systems10.5555/1224816.122517523:4(569-579)Online publication date: 1-May-2007
https://dl.acm.org/doi/10.5555/1224816.1225175
Lai KLee CFang J(2006)A critical predecessor duplication scheduling algorithm for distributed heterogeneous computing environmentsProceedings of the 5th WSEAS international conference on Telecommunications and informatics10.5555/1974762.1974863(517-522)Online publication date: 27-May-2006
https://dl.acm.org/doi/10.5555/1974762.1974863
Bozdağ DCatalyurek UÖzgüner F(2006)A task duplication based bottom-up scheduling algorithm for heterogeneous environmentsProceedings of the 20th international conference on Parallel and distributed processing10.5555/1898953.1899086(160-160)Online publication date: 25-Apr-2006
https://dl.acm.org/doi/10.5555/1898953.1899086
Liu CLi CLai KWu C(2006)Dynamic Critical Path Duplication Task Scheduling Algorithm for Distributed Heterogeneous Computing SystemsProceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 110.1109/ICPADS.2006.37(365-374)Online publication date: 12-Jul-2006
https://dl.acm.org/doi/10.1109/ICPADS.2006.37

Abstract

Cited By

Recommendations

An Approach to Compile-Time Task Scheduling in Heterogeneous Computing Systems

A Dynamic Matching and Scheduling Algorithm for Heterogeneous Computing Systems

Scheduling directed a-cyclic task graphs on a bounded set of heterogeneous processors using task duplication

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations