Efficient local search far DAG scheduling

Author

Wu, Min You ; Shu, Wei ; Gu, Jun

Author_Institution

Dept. of Electr. & Comput. Eng., New Mexico Univ., Albuquerque, NM, USA

Volume

12

Issue

6

fYear

2001

fDate

6/1/2001 12:00:00 AM

Firstpage

617

Lastpage

627

Abstract

Scheduling DAGs to multiprocessors is one of the key issues in high-performance computing. Most realistic scheduling algorithms are heuristic and heuristic algorithms often have room for improvement. The quality of a scheduling algorithm can be effectively improved by a local search. In this paper, we present a fast local search algorithm based on topological ordering. This is a compaction algorithm that can effectively reduce the schedule length produced by any DAG Scheduling algorithm. Thus, it can improve the quality of existing DAG scheduling algorithms. This algorithm can quickly determine the optimal search direction. Thus, it is of low complexity and extremely fast

Keywords

computational complexity; performance evaluation; processor scheduling; search problems; compaction algorithm; directed acyclic graph scheduling; heuristic algorithms; high-performance computing; local search; local search algorithm; multiprocessors; optimal search direction; topological ordering; Compaction; Concurrent computing; Costs; Dynamic scheduling; Heuristic algorithms; Load management; Parallel processing; Processor scheduling; Runtime; Scheduling algorithm;

fLanguage

English

Journal_Title

Parallel and Distributed Systems, IEEE Transactions on

Publisher

ieee

ISSN

1045-9219

Type

jour

DOI

10.1109/71.932715

Filename

932715