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

Authors:
Savina Bansal;Padam Kumar;Kuldip Singh
Affiliations:
-;-;-
Venue:
HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
Year:
2002

Citing 12
Cited 2

The de Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI

IEEE Transactions on Computers
Task scheduling in parallel and distributed systems

Task scheduling in parallel and distributed systems
Optimal Scheduling Algorithm for Distributed-Memory Machines

IEEE Transactions on Parallel and Distributed Systems
On Exploiting Task Duplication in Parallel Program Scheduling

IEEE Transactions on Parallel and Distributed Systems
Benchmarking and comparison of the task graph scheduling algorithms

Journal of Parallel and Distributed Computing
Efficient Local Search for DAG Scheduling

IEEE Transactions on Parallel and Distributed Systems
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
Scheduling Precedence Constrained Task Graphs with Non-Negligible Intertask Communication onto Multiprocessors

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

IEEE Transactions on Parallel and Distributed Systems

An Improved Duplication Strategy for Scheduling Precedence Constrained Graphs in Multiprocessor Systems

IEEE Transactions on Parallel and Distributed Systems
Dealing with heterogeneity through limited duplication for scheduling precedence constrained task graphs

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Duplication-based scheduling techniques are more appropriate for fine grain task graphs and for networks with high communication latencies. However, most of the algorithms are developed under the assumption of fully connected processor network and with prohibitively high O(v4) time complexity. An insertion based duplication algorithm is proposed for precedence constrained task graphs, for working with limited interconnection constrained processors. It duplicates only the most important immediate parents of a task, that too if critical. Results are presented for benchmark random task graphs, having widely varying shape and cost parameters for the clique, Hypercube and an extensible and fault tolerant binary de Bruijn (undirected) multiprocessor network. The average performance degradation, due to interconnection constraints, is about 21% in comparison to fully connected processor network. Further, the schedules generated on the fixed degree binary de-Bruijn network are within 5% of the schedules on Hypercube network, whose degree keeps on increasing with size.