Optimal and Near-Optimal Allocation of Precedence-Constrained Tasks to Parallel Processors: Defying the High Complexity Using Effective Search Techniques

Authors:
Ishfaq Ahmad;Yu-Kwong Kwok
Affiliations:
-;-
Venue:
ICPP '98 Proceedings of the 1998 International Conference on Parallel Processing
Year:
1998

Citing 0
Cited 6

FASTEST: A Practical Low-Complexity Algorithm for Compile-Time Assignment of Parallel Programs to Multiprocessors

IEEE Transactions on Parallel and Distributed Systems
Static scheduling algorithms for allocating directed task graphs to multiprocessors

ACM Computing Surveys (CSUR)
A Polynomial-Time Branching Procedure for the Multiprocessor Scheduling Problem

Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Evaluation of Search Heuristics for Embedded System Scheduling Problems

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Branch-and-bound task allocation with task clustering-based pruning

Journal of Parallel and Distributed Computing
Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Automatic tool support for scheduling applications on multiprocessor platforms is of paramount importance both to guarantee critical application demands and to keep development costs down. In this paper, we present GAST, an object-oriented evaluation environment for multiprocessor assignment and scheduling techniques. GAST is based on a decomposition approach where existing assignment and scheduling techniques have been broken down into a set of common operations. By combining these operations into a complete scheduling process, GAST offers a powerful toolbox of existing assignment and scheduling techniques. GAST has been implemented on several popular operating systems and is accompanied by a graphic visualization tool that allows for flexible interaction with the application scheduling process.