On Parallelization of Static Scheduling Algorithms

Authors:
Min-You Wu;Wei Shu
Affiliations:
Univ. of Central Florida, Orlando;Univ. of Central Florida, Orlando
Venue:
IEEE Transactions on Software Engineering
Year:
1997

Citing 13
Cited 4

Scheduling precedence graphs in systems with interprocessor communication times

SIAM Journal on Computing
Scheduling parallel program tasks onto arbitrary target machines

Journal of Parallel and Distributed Computing - Special issue: software tools for parallel programming and visualization
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
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
A parallel approach for multiprocessor scheduling

IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Static task scheduling and grain packing in parallel processing systems

Static task scheduling and grain packing in parallel processing systems

The design, implementation and initial evaluation of an advanced knowledge-based process scheduler

ACM SIGOPS Operating Systems Review
A Runtime System for Dynamic DAG Programming

IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Runtime Parallel Incremental Scheduling of DAGs

ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Generating Graphs for Visual Analytics through Interactive Sketching

IEEE Transactions on Visualization and Computer Graphics

Quantified Score

Hi-index	0.01

Visualization

Abstract

Most static algorithms that schedule parallel programs represented by macro dataflow graphs are sequential. This paper discusses the essential issues pertaining to parallelization of static scheduling and presents two efficient parallel scheduling algorithms. The proposed algorithms have been implemented on an Intel Paragon machine and their performances have been evaluated. These algorithms produce high-quality scheduling and are much faster than existing sequential and parallel algorithms.