Proceedings 21st International Conference on Distributed Computing Systems (2001)
Apr. 16, 2001 to Apr. 19, 2001
Gregory Chockler , The Hebrew University of Jerusalem
Dahlia Malkhi , The Hebrew University of Jerusalem
Michael K. Reiter , Bell Labs, Lucent Technologies
Abstract: We present a simple and efficient protocol for mutual exclusion in synchronous, message-passing distributed systems subject to failures. Our protocol borrows design principles from prior work in backoff protocols for multiple access channels such as Ethernet. Our protocol is adaptive in that the expected amortized system response time- informally, the average time a process waits before entering the critical section-is a function only of the number of clients currently contending and is independent of the maximum number of processes who might contend. In particular, in the contention-free case, a process can enter the critical section after only one round-trip message delay. We use this protocol to derive a protocol for ordering operations on a replicated object in an asynchronous distributed system subject to failures. This protocol is always safe, is probabilistically live during periods of stability, and is suitable for deployment in practical systems.
G. Chockler, D. Malkhi and M. K. Reiter, "Backoff Protocols for Distributed Mutual Exclusion and Ordering," Proceedings 21st International Conference on Distributed Computing Systems(ICDCS), Mesa, AZ, 2001, pp. 0011.