A fast and scalable scheduling algorithm for distributed memory systems

Authors:
S. Darbha;D. P. Agrawal
Affiliations:
-;-
Venue:
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
Year:
1995

Citing 0
Cited 8

Static scheduling algorithms for allocating directed task graphs to multiprocessors

ACM Computing Surveys (CSUR)
A duplication based compile time scheduling method for task parallelism

Compiler optimizations for scalable parallel systems
A Robust Compile Time Method for SchedulingTask Parallelism on Distributed Memory Machines

The Journal of Supercomputing
DFRN: A New Approach for Duplication Based Scheduling for Distributed Memory Multiprocessor Systems

IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Task scheduling on bus-based networks of workstations

Cluster computing
Effect of variation in compile time costs on scheduling tasks on distributed memory systems

FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
A high performance, low complexity algorithm for compile-time task scheduling in heterogeneous systems

Parallel Computing - Heterogeneous computing
List scheduling with duplication for heterogeneous computing systems

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The inter-processor communication time is a major bottleneck for distributed memory systems (DMSs) and can be reduced by having an efficient task partitioning and scheduling strategy. The paper deals with the scheduling issues and presents an algorithm to schedule tasks onto DMSs. The complexity of this algorithm is O(V/sup 2/), where Vr is the number of nodes of the directed acyclic graph (DAG). This algorithm has been applied to some practical DAGs and the results obtained using this algorithm are very promising.