We present an efficient fault-tolerant solution to the distributed mutual exclusion problem. Our protocol requires log n messages in the best case and is resilient to both site and communication failures, even when such failures lead to network partitioning. Furthermore, the protocol exhibits a property of graceful degradation, i.e., it requires more message only as the number of failures increase in the network.
CITATION STYLE
Agrawal, D., & El Abbadi, A. (1989). Efficient solution to the distributed mutual exclusion problem (preliminary report). In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (pp. 193–200). Publ by ACM.
Mendeley helps you to discover research relevant for your work.