A Bottom-Up Approach to Task Scheduling on Distributed Memory Multiprocessors

Authors:
Neelima Mehdiratta;Kanad Ghose
Affiliations:
State University of New York at Binghamton, USA;State University of New York at Binghamton, USA
Venue:
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 02
Year:
1994

Citing 0
Cited 5

A duplication based compile time scheduling method for task parallelism

Compiler optimizations for scalable parallel systems
Automatic Parallelization and Scheduling of Programs on Multiprocessors using CASCH

ICPP '97 Proceedings of the international Conference on Parallel Processing
Benchmarking the Task Graph Scheduling Algorithms

IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Iterative list scheduling for heterogeneous computing

Journal of Parallel and Distributed Computing
Heterogeneous makespan and energy-constrained DAG scheduling

Proceedings of the 2013 workshop on Energy efficient high performance parallel and distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new approach to statically schedule parallel programs modeled as Directed Acyclic Graphs (DAGs) on various distributed memory multi-processor topologies represented as processor graphs to reduce the overall execution time of the program. The scheduler factors in the processor topology, communication delays and delays due to channel conflicts for scheduling. Our scheme differs dramatically from existing schedulers in that tasks of the DAG are scheduled bottom up. Experimental results presentedfor message switched systems using the hypercube and torus topologies show the effectiveness of our scheme. Our scheme can also be adapted for other topologies and routing schemes such as wormhole routing and circuit switching.