Efficient Local Search for DAG Scheduling

Authors:
Min-You Wu;Wei Shu;Jun Gu
Affiliations:
Univ. of New Mexico, Albuquerque;Univ. of New Mexico, Albuquerque;Hong Kong Univ. of Science and Technology, Kowloon, Hong Kong
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
2001

Citing 15
Cited 5

Scheduling parallel program tasks onto arbitrary target machines

Journal of Parallel and Distributed Computing - Special issue: software tools for parallel programming and visualization
Efficient local search for very large-scale satisfiability problems

ACM SIGART Bulletin
PYRROS: static task scheduling and code generation for message passing multiprocessors

ICS '92 Proceedings of the 6th international conference on Supercomputing
Applications and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed memory multiprocessors

Proceedings of the 1992 ACM/IEEE conference on Supercomputing
Task scheduling in parallel and distributed systems

Task scheduling in parallel and distributed systems
FASTEST: A Practical Low-Complexity Algorithm for Compile-Time Assignment of Parallel Programs to Multiprocessors

IEEE Transactions on Parallel and Distributed Systems
A comparison of list schedules for parallel processing systems

Communications of the ACM
Partitioning and Scheduling Parallel Programs for Multiprocessors

Partitioning and Scheduling Parallel Programs for Multiprocessors
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Grain Size Determination for Parallel Processing

IEEE Software
Hypertool: A Programming Aid for Message-Passing Systems

IEEE Transactions on Parallel and Distributed Systems
A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures

IEEE Transactions on Parallel and Distributed Systems
DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors

IEEE Transactions on Parallel and Distributed Systems
Average Time Complexity of the SAT 1.2 Algorithm

ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
(R) FAST: A Low-Complexity Algorithm for Efficient Scheduling of DAGs on Parallel Processors

ICPP '96 Proceedings of the Proceedings of the 1996 International Conference on Parallel Processing - Volume 2

Duplication-Based Scheduling Algorithm for Interconnection-Constrained Distributed Memory Machines

HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
Compiler-Controlled Parallelism-Independent Scheduling for Parallel and Distributed Systems

PARA '02 Proceedings of the 6th International Conference on Applied Parallel Computing Advanced Scientific Computing
An Improved Duplication Strategy for Scheduling Precedence Constrained Graphs in Multiprocessor Systems

IEEE Transactions on Parallel and Distributed Systems
Push-Pull: Deterministic Search-Based DAG Scheduling for Heterogeneous Cluster Systems

IEEE Transactions on Parallel and Distributed Systems
Task assignment for minimizing application completion time using honeybee mating optimization

Frontiers of Computer Science: Selected Publications from Chinese Universities

Quantified Score

Hi-index	0.00

Visualization

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.