@inproceedings{c585449afaa845d3ad3d29d0e169bb9d,
title = "A robust distributed mutual exclusion algorithm",
abstract = "Correct operation of a distributed system with replicated resources requires that mutual exclusion be maintained among independent requests to these resources at different sites in the system. In this paper, we propose “asymptotically high resiliency” as a performance measure for fault-tolerant mutual exclusion algorithms for systems where sites can fail. We then present an efficient highly fault-tolerant algorithm for mutual exclusion. The algorithm is totally distributed in nature and is shown to have a message overhead of O(√ N log N) where N is the number of sites. The algorithm provides mutual exclusion with a resiliency (that is, probability that permission for a mutual exclusion request is obtained in spite of site failures) approaching 1 asymptotically with an increase in N.",
author = "Sampath Rangarajan and Tripathi, \{Satish K.\}",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1992.; 5th International Workshop on Distributed Algorithms, WDAG 1991 ; Conference date: 07-10-1991 Through 09-10-1991",
year = "1992",
doi = "10.1007/BFb0022455",
language = "English",
isbn = "9783540552369",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "295--308",
editor = "Spirakis, \{Paul G.\} and Lefteris Kirousis and Sam Toueg",
booktitle = "Distributed Algorithms - 5th International Workshop, WDAG 1991, Proceedings",
address = "Germany",
}