Abstract:
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 to improve. The quality of a scheduling algorithm can be eectively 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 eectively 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. Index terms|DAG scheduling, multiprocessors, fast local search, quality, complexity. 1
Citations
|
230
|
Partitioning and Scheduling Parallel Programs for Multiprocessors
– Sarkar
- 1989
|
|
175
|
Optimization and approximation in deterministic sequencing and scheduling-A survey
– Graham, Lawler, et al.
- 1979
|
|
157
|
A compile-time scheduling heuristic for interconnection constrained-heterogeneous processor architectures
– Sih, Lee
- 1993
|
|
135
|
Hypenool: A Programming Aid for Message-Passing Systems
– Wu, Gajski
- 1990
|
|
133
|
Parallel sequencing and assembly line problems
– Hu
- 1961
|
|
131
|
DSC: Scheduling parallel tasks on an unbounded number of processors
– Yang, Gerasoulis
- 1994
|
|
114
|
A comparison of list schedules for parallel processing systems
– Adam, Chandy, et al.
- 1974
|
|
93
|
Computers and Intractability: A Guide to the Theory of NP-completeness
– Gary, Johnson
- 1979
|
|
88
|
Scheduling parallel program tasks onto arbitrary target machines
– Rewini, Lewis
- 1990
|
|
83
|
PYRROS: Static Task Scheduling and Code Generation for Message-Passing Multiprocessors
– Yang, Gerasoulis
- 1992
|
|
72
|
Grain Size Determination for Parallel Processing
– Kruatrachue, Lewis
- 1988
|
|
54
|
A Comparison of Multiprocessor Scheduling Heuristics
– Khan, McCreary, et al.
- 1994
|
|
47
|
Application and Performance Analysis of a Compile-Time Optimization Approach for List Scheduling Algorithms on Distributed-Memory Multiprocessors
– Chung, Ranka
- 1992
|
|
23
|
Parallel Algorithms and Architectures for Very Fast AI Search
– Gu
- 1989
|
|
16
|
Ecient local search for very large-scale satis problems
– Gu
- 1992
|
|
10
|
Fast search algorithms for the N-queen problem
– Socic, Gu
- 1991
|
|
9
|
Average time complexities of several local search algorithms for the satisfiability problem (sat
– Gu, Gu
- 1991
|
|
9
|
FASTEST: A practical low-complexity algorithm for compile-time assignment of parallel programs to multiprocessors
– Kwok, Ahmad
- 1999
|
|
8
|
Computer and Job-Shop Scheduling Theory
– Coman
- 1976
|
|
8
|
How to search for million queens
– Sosic, Gu
- 1988
|
|
3
|
Microword length minimization in microprogrammed controller synthesis
– Puri, Gu
- 1993
|
|
1
|
How to solve Very Large-Scale Satis problems
– Gu
- 1988
|
|
1
|
Local search for satis (SAT) problem
– Gu
- 1993
|
|
1
|
FAST: A low-complexity algorithm for ecient scheduling of DAGs on parallel processors
– Kwok, Ahmad, et al.
- 1996
|
|
1
|
Ecient local search with con minimization
– Sosic, Gu
- 1994
|
