RESOLVING ALL DEADLOCKS IN DISTRIBUTED SYSTEMS

被引：11

作者：

LEE, SJ ^{[1
]}

KIM, JL ^{[1
]}

机构：

[1] BELL COMMUN RES INC,RRC 1N2111,PISCATAWAY,NJ 08854

来源：

INFORMATION PROCESSING LETTERS | 1995年 / 55卷 / 05期

关键词：

DISTRIBUTED SYSTEMS; DEADLOCK DETECTION; DEADLOCK RESOLUTION; DISTRIBUTED ALGORITHMS; WAIT-FOR GRAPH;

D O I：

10.1016/0020-0190(95)00115-S

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

A distributed algorithm is presented for deadlock detection and resolution in distributed systems. The unique feature of the proposed algorithm is that it detects and resolves all deadlocks reachable from the initiator of the algorithm using 2n time units and 2e messages, where n and e are the number of nodes and edges in the wait-for graph reachable from the initiator, respectively. A simple analysis shows that our scheme allows less number of algorithm initiations throughout the system and faster deadlock detection.

引用

页码：265 / 271

页数：7

共 8 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER

[2]

BRACHA G, 1984, 3RD P ANN ACM S PRIN, P285

[3] DISTRIBUTED DEADLOCK DETECTION [J].