A task duplication scheme for resolving deadlocks in clustered DAGs

Authors:
Bassel R. Arafeh
Affiliations:
Department of Computer Science, Sultan Qaboos University, Oman
Venue:
Parallel Computing
Year:
2003

Citing 16
Cited 1

Automatic determination of grain size for efficient parallel processing

Communications of the ACM - Special issue: multiprocessing
Towards an architecture-independent analysis of parallel algorithms

SIAM Journal on Computing
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 Clustering and Scheduling for Distributed Memory Parallel Architectures

IEEE Transactions on Parallel and Distributed Systems
Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors

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

IEEE Transactions on Parallel and Distributed Systems
Clustering Algorithm for Parallelizing Software Systems in Multiprocessors Environment

IEEE Transactions on Software Engineering - Special issue on architecture-independent languages and software tools parallel processing
Static scheduling algorithms for allocating directed task graphs to multiprocessors

ACM Computing Surveys (CSUR)
Partitioning and Scheduling Parallel Programs for Multiprocessors

Partitioning and Scheduling Parallel Programs for Multiprocessors
Grain Size Determination for Parallel Processing

IEEE Software
Hypertool: A Programming Aid for Message-Passing Systems

IEEE Transactions on Parallel and Distributed Systems
On the Granularity and Clustering of Directed Acyclic Task Graphs

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

IEEE Transactions on Parallel and Distributed Systems
Clustering Algorithm for Scheduling Parallel Programs on NOWs with Synchronization Requirements at the Application Level

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
A New Clustering Algorithm for Large Communication Delays

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
An Asymptotic O(ln rho/ln ln rho)-Approximation Algorithm for the Scheduling Problem with Duplication on Large Communication Delay Graphs

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science

A heuristic for scheduling parallel programs with synchronous communication model in the network computing environments

NPC'05 Proceedings of the 2005 IFIP international conference on Network and Parallel Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work introduces a duplication-based deadlock resolution (DBDR) scheme in clustered directed acyclic graphs using three methods for duplicating a task. The scheme can be embedded within any clustering technique for handling synchronous communication with an added cost of O(|E| + (|V|)2). The main objective of task duplication, besides to resolving deadlocks, has been the reduction of communication cost and the improvement in the program computation to communication ratio. The embedding of the DBDR scheme within a clustering technique is shown along with the analysis of its complexity. A comparison between deadlock resolution strategy using the DBDR and deadlock avoidance strategy using the same clustering technique is given.