Optimal scheduling algorithm for distributed-memory machines

Author

Darbha, Sekhar ; Agrawal, Dharma P.

Author_Institution

Dept. of Electr. & Comput. Eng., Rutgers Univ., Piscataway, NJ, USA

Volume

9

Issue

1

fYear

1998

fDate

1/1/1998 12:00:00 AM

Firstpage

87

Lastpage

95

Abstract

Task Scheduling is one of the key elements in any distributed-memory machine (DMM), and an efficient algorithm can help reduce the interprocessor communication time. As optimal scheduling of tasks to DMMs is a strong NP-hard problem, many heuristic algorithms have been introduced in the literature. This paper presents a Task Duplication based Scheduling (TDS) algorithm which can schedule directed acyclic graphs (DAGs) with a complexity of O(|V|²), where |V| is the number of tasks in the DAG. This algorithm generates an optimal schedule for a class of DAGs which satisfy a simple cost relationship. The performance of the algorithm has been observed by its application to some practical DAGs, and by comparing it with other existing scheduling schemes in terms of the schedule length and algorithm complexity

Keywords

computational complexity; directed graphs; distributed memory systems; processor scheduling; NP-hard problem; algorithm complexity; complexity; directed acyclic graphs; distributed-memory machines; interprocessor communication time; optimal scheduling algorithm; task duplication based scheduling; task scheduling; Communications technology; Computational efficiency; Cost function; Heuristic algorithms; NP-hard problem; Optimal scheduling; Polynomials; Processor scheduling; Scheduling algorithm; Very large scale integration;

fLanguage

English

Journal_Title

Parallel and Distributed Systems, IEEE Transactions on

Publisher

ieee

ISSN

1045-9219

Type

jour

DOI

10.1109/71.655248

Filename

655248