An Efficient Weak Mutual Exclusion Algorithm.

P. Romano and L. Rodrigues.

Selected sections of this report will be published in the Proceedings of the 8th International Symposium on Parallel and Distributed Computing. Lisboa, Portugal, June 2009.

Abstract

The Weak Mutual Exclusion (WME) is a recently proposed abstraction which, analogously to classical Distributed Mutual Exclusion (DME), permits to serialize concurrent accesses to a shared resource. Unlike DME, however, the WME abstraction regulates the access to a replicated shared resource.

This paper presents an efficient WME algorithm which outperforms previous solutions in terms of both communication latency and message complexity, while relying on minimal synchrony assumptions.

Also available extended report (pdf).

Luís Rodrigues