An efficient distributed deadlock detection algorithm

We propose a distributed deadlock detection algorithm which detects cycles made of back edges in a distributed search tree. Our algorithm detects the deadlocks in which the initiator of the algorithm is directly or indirectly involved, while most of the proposed deadlock detection algorithms only de...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Proceedings of 15th International Conference on Distributed Computing Systems s. 169 - 178
Hlavní autori: Soojung Lee, Kim, J.L.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 1995
Predmet:
Detection algorithms
Probes
System recovery
ISBN:9780818670251, 0818670258
ISSN:1063-6927
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract We propose a distributed deadlock detection algorithm which detects cycles made of back edges in a distributed search tree. Our algorithm detects the deadlocks in which the initiator of the algorithm is directly or indirectly involved, while most of the proposed deadlock detection algorithms only detect the cycles in which the initiator is directly involved. Our algorithm is a reduced version of the one proposed previously, which resolves all deadlocks reachable from the initiator in a single execution by propagating the probe messages to the nodes in the search tree and having each node resolve deadlocks in its subtree with collected information on dependency between its subtree nodes. Our algorithm substantially reduces the message overhead of the previous algorithm. We compare the performance of our algorithm with others through extensive simulation. It is found that our algorithm detects deadlocks as fast as the previous algorithm with much fewer messages. The simulation results show that our algorithm outperforms other algorithms considerably in major performance measures.
AbstractList We propose a distributed deadlock detection algorithm which detects cycles made of back edges in a distributed search tree. Our algorithm detects the deadlocks in which the initiator of the algorithm is directly or indirectly involved, while most of the proposed deadlock detection algorithms only detect the cycles in which the initiator is directly involved. Our algorithm is a reduced version of the one proposed previously, which resolves all deadlocks reachable from the initiator in a single execution by propagating the probe messages to the nodes in the search tree and having each node resolve deadlocks in its subtree with collected information on dependency between its subtree nodes. Our algorithm substantially reduces the message overhead of the previous algorithm. We compare the performance of our algorithm with others through extensive simulation. It is found that our algorithm detects deadlocks as fast as the previous algorithm with much fewer messages. The simulation results show that our algorithm outperforms other algorithms considerably in major performance measures.
Author Kim, J.L.
Soojung Lee
Author_xml – sequence: 1
  surname: Soojung Lee
  fullname: Soojung Lee
  organization: Commun. Syst. Res. & Dev. Center, Samsung Electron. Co., Seoul, South Korea
– sequence: 2
  givenname: J.L.
  surname: Kim
  fullname: Kim, J.L.
BookMark eNotj8tOwzAQRS1RJErJB8AqP5AwtjN-LKvwqlSJBbCubGcMhjRBiVnw90Qqq3MWR1e6l2w1jAMxds2h5hzs7a69a19qbi3WCABcnbHCagOGG6VBIF-xNQclK2WFvmDFPH8uGSAaIXDNcDuUFGMKiYZcdmnOU_I_mbqyI9f1Y_haJFPIaRxK17-PU8ofxyt2Hl0_U_HPDXt7uH9tn6r98-Ou3e6rxKHJFSevUegITmrrGwBSQWkXvbImAKH1i0vSTRDBak0iSCL0PjagrPNObtjNaTcR0eF7Skc3_R5OP-UfvyBI0g
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ICDCS.1995.500016
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library Online
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 178
ExternalDocumentID 500016
GroupedDBID 23M
29G
29P
6IE
6IF
6IH
6IK
6IL
6IM
6IN
AAJGR
AAWTH
ABLEC
ACGFS
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IJVOP
IPLJI
M43
OCL
RIE
RIL
RNS
ID FETCH-LOGICAL-i104t-1eb7527f0a379b400e6c67afb698c0e59bafb3e74c2c977e2c3ee5bbf4069aba3
IEDL.DBID RIE
ISBN 9780818670251
0818670258
ISICitedReferencesCount 13
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=500016&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1063-6927
IngestDate Tue Aug 26 21:45:52 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i104t-1eb7527f0a379b400e6c67afb698c0e59bafb3e74c2c977e2c3ee5bbf4069aba3
PageCount 10
ParticipantIDs ieee_primary_500016
PublicationCentury 1900
PublicationDate 19950000
PublicationDateYYYYMMDD 1995-01-01
PublicationDate_xml – year: 1995
  text: 19950000
PublicationDecade 1990
PublicationTitle Proceedings of 15th International Conference on Distributed Computing Systems
PublicationTitleAbbrev ICDCS
PublicationYear 1995
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000558225
ssj0005863
Score 1.3918977
Snippet We propose a distributed deadlock detection algorithm which detects cycles made of back edges in a distributed search tree. Our algorithm detects the deadlocks...
SourceID ieee
SourceType Publisher
StartPage 169
SubjectTerms Detection algorithms
Probes
System recovery
Title An efficient distributed deadlock detection algorithm
URI https://ieeexplore.ieee.org/document/500016
WOSCitedRecordID wos500016&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/eLvHCXMwlV09T8MwELVoxcBUKEV8ywOr28SJv0ZUqGCpKgFSt8p2zlABaVVSfj-2k7ZCYmG7JEpix7LucnfvPYRupDOF9bE9obkEkkvliOE0J8qYQkt_l05dFJsQ47GcTtWk4dmOWBgAiM1n0A9mrOUXC7sOqbIBixFKC7WEEDVUa5tOSRiTdEezlzDJ6956nhGuqIjUj4G8zft42RDvbI7TptqZJmrwOLwbPgUIH-vXb_uluhKdzqjzr-Eeot4OvIcnW7d0hPag7KLORr0BN5v5GLHbEkMkkPBPwUUg0A3aV1Dgwq-793Hv3qhip1aJ9cfrYjWv3j576GV0_zx8II2IApn7P62KpGAEo8IlOhPK-B0L3HKhneFK2gSYMt7OQOSWWh8LArUZADPGBUisNjo7Qe1yUcIpwjrjPh5wKpMgc2NTf5k5YNoaGiWsz1A3fITZsubJmNXzP__z7AU6qMHhIZlxidrVag1XaN9-V_Ov1XVc2x_F0J7G
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwFG4UTfSEIsbf7uC1sHVr1x4NSiAiIRETbqTtXpWow-Dw77ftBsTEi7e3LdvaNc17e-9934fQDTcq0za2xyThgBMuDFaMJFgolUlu75KR8WIT6XDIJxMxqni2PRYGAHzzGbSc6Wv52VwvXaqsTX2Eso12aJKQqARrrRMqIaWcbIj2QspZ2V3PYswEST35o6Nvs16eV9Q7q-OoqndGoWj3O3edJwfio63yfb90V7zb6db_NeAD1NzA94LR2jEdoi3IG6i-0m8Iqu18hOhtHoCnkLBPCTJHoevUryALMrvy1su9WaPwvVp5IN9f5otZ8frRRM_d-3GnhysZBTyz_1oFjkCllKQmlHEqlN2zwDRLpVFMcB0CFcraMaSJJtpGg0B0DECVMg4UK5WMj1Etn-dwggIZMxsRGBFz4InSkb1MDVCpFfEi1qeo4T7C9LNkypiW8z_78-w12uuNHwfTQX_4cI72S6i4S21coFqxWMIl2tXfxexrceXX-Qc_NaIN
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+15th+International+Conference+on+Distributed+Computing+Systems&rft.atitle=An+efficient+distributed+deadlock+detection+algorithm&rft.au=Soojung+Lee&rft.au=Kim%2C+J.L.&rft.date=1995-01-01&rft.pub=IEEE&rft.isbn=9780818670251&rft.issn=1063-6927&rft.spage=169&rft.epage=178&rft_id=info:doi/10.1109%2FICDCS.1995.500016&rft.externalDocID=500016
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1063-6927&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1063-6927&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1063-6927&client=summon