Optimal deadlock detection in distributed systems based on locally constructed wait-for graphs

We present a new algorithm for detecting generalized deadlocks in distributed systems. Our algorithm incrementally constructs and reduces a wait-for graph (WFG) at an initiator process. This WFG is then searched for deadlock. The proposed algorithm has two primary advantages: First, it avoids sendin...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of the 16th International Conference on Distributed Computing Systems pp. 613 - 619
Main Authors: Shigang Chen, Yi Deng, Attie, P., Wei Sun
Format: Conference Proceeding
Language:English
Published: IEEE 1996
Subjects:
Complexity theory
Computer science
Image edge detection
System recovery
Task analysis
Time complexity
Topology
ISBN:9780818673993, 0818673990
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract We present a new algorithm for detecting generalized deadlocks in distributed systems. Our algorithm incrementally constructs and reduces a wait-for graph (WFG) at an initiator process. This WFG is then searched for deadlock. The proposed algorithm has two primary advantages: First, it avoids sending messages along the edges of the global wait-for graph (WFG), thereby achieving a worst-case message complexity of 2n, where n is the number of processes in the WFG. Since information must be obtained from every process reachable from the initiator, this is optimal to within a constant factor. All the existing algorithms for the same problem construct a distributed snapshot of the WFG. As this involves sending messages along the edges of the WFG, the best available message complexity among these algorithms is 4e-2n+2l, which is O(n/sup 2/) in the worst case, where e and l are the number of edges and leaves in the WFG, respectively. Second, since the information about a detected deadlock is readily available at the initiator process, rather than distributed among different processes, it significantly simplifies the task of deadlock resolution, and helps to reduce system overhead associated with the resolution. The time complexity of our algorithm is also better than or equal to the existing algorithms.
AbstractList We present a new algorithm for detecting generalized deadlocks in distributed systems. Our algorithm incrementally constructs and reduces a wait-for graph (WFG) at an initiator process. This WFG is then searched for deadlock. The proposed algorithm has two primary advantages: First, it avoids sending messages along the edges of the global wait-for graph (WFG), thereby achieving a worst-case message complexity of 2n, where n is the number of processes in the WFG. Since information must be obtained from every process reachable from the initiator, this is optimal to within a constant factor. All the existing algorithms for the same problem construct a distributed snapshot of the WFG. As this involves sending messages along the edges of the WFG, the best available message complexity among these algorithms is 4e-2n+2l, which is O(n/sup 2/) in the worst case, where e and l are the number of edges and leaves in the WFG, respectively. Second, since the information about a detected deadlock is readily available at the initiator process, rather than distributed among different processes, it significantly simplifies the task of deadlock resolution, and helps to reduce system overhead associated with the resolution. The time complexity of our algorithm is also better than or equal to the existing algorithms.
Author Yi Deng
Wei Sun
Shigang Chen
Attie, P.
Author_xml – sequence: 1
  surname: Shigang Chen
  fullname: Shigang Chen
  email: s-chen5@cs.uiuc.edu
  organization: Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA
– sequence: 2
  surname: Yi Deng
  fullname: Yi Deng
  email: deng@cs.fiu.edu
– sequence: 3
  givenname: P.
  surname: Attie
  fullname: Attie, P.
  email: attie@cs.fiu.edu
– sequence: 4
  surname: Wei Sun
  fullname: Wei Sun
  email: weisun@cs.fiu.edu
BookMark eNotkM1OwzAQhC0BElDyAHDyCyR468Sxjyj8VarUA3ClWtsbMKRJFLtCfXuCymlmNZ9G2rlkp_3QE2PXIAoAYW5XzX3zUoAxqqiEFrA8YZmptdCgVS2Nkecsi_FLCAFGGVHBBXvfjCnssOOe0HeD-55NIpfC0PPQcx9imoLdJ_I8HmKiXeQW43zN-Yxj1x24G_qZ2rs_6AdDytth4h8Tjp_xip212EXK_nXB3h4fXpvnfL15WjV36zyAKFPuRUtAJdakS0SwVaukNxqWylgltZZoiWyNzqOzSlTeutZIBcbpkjQ4uWA3x95ARNtxml-aDtvjCPIX5TRW-A
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ICDCS.1996.508012
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE/IET Electronic Library
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EndPage 619
ExternalDocumentID 508012
Genre orig-research
GroupedDBID 6IE
6IK
6IL
AAJGR
AAWTH
ACGHX
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
OCL
RIE
RIL
ID FETCH-LOGICAL-i104t-d0fe1e4a7e84aa1b5f63d981269b63883abeeb7acdacb605dbcf93619c84e81c3
IEDL.DBID RIE
ISBN 9780818673993
0818673990
ISICitedReferencesCount 25
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=508012&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Aug 27 02:29:03 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i104t-d0fe1e4a7e84aa1b5f63d981269b63883abeeb7acdacb605dbcf93619c84e81c3
PageCount 7
ParticipantIDs ieee_primary_508012
PublicationCentury 1900
PublicationDate 19960000
PublicationDateYYYYMMDD 1996-01-01
PublicationDate_xml – year: 1996
  text: 19960000
PublicationDecade 1990
PublicationTitle Proceedings of the 16th International Conference on Distributed Computing Systems
PublicationTitleAbbrev ICDCS
PublicationYear 1996
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0001969051
Score 1.4460042
Snippet We present a new algorithm for detecting generalized deadlocks in distributed systems. Our algorithm incrementally constructs and reduces a wait-for graph...
SourceID ieee
SourceType Publisher
StartPage 613
SubjectTerms Complexity theory
Computer science
Image edge detection
System recovery
Task analysis
Time complexity
Topology
Title Optimal deadlock detection in distributed systems based on locally constructed wait-for graphs
URI https://ieeexplore.ieee.org/document/508012
WOSCitedRecordID wos508012&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ3PS8MwFMeDDg-epnPib3Lwmq1tuiY5T4eCzIE_2MmRH69QnJ24qvjf-5LWDcGLtzSF0uaRfvOS9z6PkHOh5cCB0szkkrMUTcwURBETPE1MwnOTB073440Yj-V0qiYNZzvkwgBACD6Dnm-Gs3y3sO9-q6yPi4nIVxTeFCKrU7XW2ykq86SpQHj0jDbU3YbotLrmzaFmHKn-9fBieOcz9bJe_dBfxVWCtoza_3qrHdJd5-jRyUp9dskGlB3S_inSQJs5u0eebvGn8KLn1KE1UbmesVGF-KuSFiV1Hpzra16BozXVeUm9sjmK94PQzb-oXTScWez-1EXFcKVLA-p62SUPo8v74RVriiqwAj2virkohxhSLUCmWsdmkGfcKZT5TBmci5JrA2CEtk5bg76OMzZXHN0sK1OQseX7pFUuSjggNIUks8oD7pxNUfZVNrDoH3limzIicYek40dr9lpzM2b1QB392XtMtut4aL-5cUJa-FFwSrbsR1Us386Crb8BTNOocw
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ3fS8MwEMeDTEGfpnPib_Pga7e2SX_keTo2nHPglD058uMKw9mJq4r_vZe0bgi--JamUNoc6TeX3H2OkMtEppEBIT2VpczjaGJPgO97CeOhClmmMsfpfhwkw2E6mYhRxdl2uTAA4ILPoGWb7izfLPS73Spr42LCtxWFNyPOQ79M1lpvqIjYsqYc49FS2lB5K6bT6ppVx5qBL9r9zlXn3ubqxa3ysb_Kqzh16db_9V67pLnO0qOjlf7skQ3IG6T-U6aBVrN2nzzd4W_hRc6pQXuidj1jo3ARWDmd5dRYdK6tegWGllznJbXaZijed1I3_6J6UZFmsftTzgoP17rUwa6XTfLQvR53el5VVsGboe9VeMbPIAAuE0i5lIGKspgZgUIfC4WzMWVSAahEaiO1Qm_HKJ0Jho6WTjmkgWYHpJYvcjgklEMYa2ERd0ZzFH4RRxo9JMtsEyoJzRFp2NGavpbkjGk5UMd_9l6Q7d74djAd9Ic3J2SnjI62Wx2npIYfCGdkS38Us-XbubP7Nz5Iq7o
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+the+16th+International+Conference+on+Distributed+Computing+Systems&rft.atitle=Optimal+deadlock+detection+in+distributed+systems+based+on+locally+constructed+wait-for+graphs&rft.au=Shigang+Chen&rft.au=Yi+Deng&rft.au=Attie%2C+P.&rft.au=Wei+Sun&rft.date=1996-01-01&rft.pub=IEEE&rft.isbn=9780818673993&rft.spage=613&rft.epage=619&rft_id=info:doi/10.1109%2FICDCS.1996.508012&rft.externalDocID=508012
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818673993/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818673993/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818673993/sc.gif&client=summon&freeimage=true