A task duplication scheme for resolving deadlocks in clustered DAGs

Research output: Contribution to journalArticle

3 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)795-820
Number of pages26
JournalParallel Computing
Volume29
Issue number6
DOIs
Publication statusPublished - Jun 2003

Fingerprint

Deadlock
Duplication
Communication
Clustering
Deadlock Avoidance
Costs
Directed Acyclic Graph
Communication Cost
Strategy

Keywords

  • Clustering
  • Duplication-based deadlock resolution
  • Network of workstations
  • Scheduling algorithms
  • Synchronous communication

ASJC Scopus subject areas

  • Computer Science Applications
  • Hardware and Architecture
  • Control and Systems Engineering

Cite this

A task duplication scheme for resolving deadlocks in clustered DAGs. / Arafeh, Bassel R.

In: Parallel Computing, Vol. 29, No. 6, 06.2003, p. 795-820.

Research output: Contribution to journalArticle

@article{a2668ecbe55f49efa3e8d157c81cd1ca,
title = "A task duplication scheme for resolving deadlocks in clustered DAGs",
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.",
keywords = "Clustering, Duplication-based deadlock resolution, Network of workstations, Scheduling algorithms, Synchronous communication",
author = "Arafeh, {Bassel R.}",
year = "2003",
month = "6",
doi = "10.1016/S0167-8191(03)00059-0",
language = "English",
volume = "29",
pages = "795--820",
journal = "Parallel Computing",
issn = "0167-8191",
publisher = "Elsevier",
number = "6",

}

TY - JOUR

T1 - A task duplication scheme for resolving deadlocks in clustered DAGs

AU - Arafeh, Bassel R.

PY - 2003/6

Y1 - 2003/6

N2 - 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.

AB - 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.

KW - Clustering

KW - Duplication-based deadlock resolution

KW - Network of workstations

KW - Scheduling algorithms

KW - Synchronous communication

UR - http://www.scopus.com/inward/record.url?scp=0038147164&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0038147164&partnerID=8YFLogxK

U2 - 10.1016/S0167-8191(03)00059-0

DO - 10.1016/S0167-8191(03)00059-0

M3 - Article

AN - SCOPUS:0038147164

VL - 29

SP - 795

EP - 820

JO - Parallel Computing

JF - Parallel Computing

SN - 0167-8191

IS - 6

ER -