A task duplication scheme for resolving deadlocks in clustered dags

DOI10.1016/S0167-8191(03)00059-0MaRDI QIDQ436204zbMATH OpenOpenAlexFDO

Authors Bassel R. Arafeh

Publication date 30 July 2012

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-8191(03)00059-0

zbMATH Keywords

clusteringduplication-based deadlock resolutionnetwork of workstationsscheduling algorithmssynchronous communication

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Parallel algorithms in computer science (68W10)

Recommendations

• Deadlock resolution in wait-for graphs by vertex/arc deletion
• Deletion graph problems based on deadlock resolution
• Resolving all deadlocks in distributed systems
• scientific article; zbMATH DE number 139938
• Local Distributed Deadlock Detection by Cycle Detection and Clusterng

This page was built for publication: A task duplication scheme for resolving deadlocks in clustered dags

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436204)