Backoff Protocols for Distributed Mutual Exclusion and Ordering Export

@inproceedings{citeulike:2240674, 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...}, author = {Chockler, G. and Malkhi, D. and Reiter, M.}, citeulike-article-id = {2240674}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.2160}, keywords = {exclusion, mutual}, pages = {11--20}, posted-at = {2008-01-16 19:45:48}, priority = {2}, title = {Backoff Protocols for Distributed Mutual Exclusion and Ordering}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.2160} }

TY - CONF ID - citeulike:2240674 L3 - citeulike-article-id:2240674 N2 - 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... EP - 20 TI - Backoff Protocols for Distributed Mutual Exclusion and Ordering SP - 11 KW - exclusion KW - mutual AU - Chockler, G AU - Malkhi, D AU - Reiter, M UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.2160 ER -