.png){kind=icon}
Return
A quorum-based self-stabilizing distributed mutual exclusion algorithm
.png){kind=icon}
PRE
AI
DOI：10.1006/jpdc.2001.1792.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we present a self-stabilizing quorum-based distributed mutual exclusion algorithm. Our algorithm is designed for an asynchronous message-passing model. The algorithm scales well since it has constant synchronization delay and its message complexity is proportional to the square root of the number of processes in the system. The algorithm tolerates message loss. The algorithm places few assumptions on timeouts needed for its implementation. All this allows for a ready implementation of the algorithm on practical distributed architectures. (C) 2002 Elsevier Science (USA).
Keywords:
SYSTEMS
ATOMICITY
Journal
IF:
4
Papers:
3.8K
Citations:
4.8K
Organization
No organization information available
Cited Papers
Use of cross correlation in studying the response of lightly damped structures to random forces..png)
AIAA Journal
AIAA JournalIF0
PREAI
ShareSave
ShareSaveShareSave
ShareSaveShareSaveShareSave
View more