Performance of fair distributed mutual exclusion algorithms

Authors:
Kandarp Jani;Ajay D. Kshemkalyani
Affiliations:
Computer Science Department, Univ. of Illinois at Chicago, Chicago, IL;Computer Science Department, Univ. of Illinois at Chicago, Chicago, IL
Venue:
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
Year:
2004

Citing 7
Cited 0

A taxonomy of distributed mutual exclusion

Journal of Parallel and Distributed Computing
A simulation study on distributed mutual exclusion

Journal of Parallel and Distributed Computing
A Fair Distributed Mutual Exclusion Algorithm

IEEE Transactions on Parallel and Distributed Systems
An optimal algorithm for mutual exclusion in computer networks

Communications of the ACM
Time, clocks, and the ordering of events in a distributed system

Communications of the ACM
Difficulties in simulating the internet

IEEE/ACM Transactions on Networking (TON)
Performance of the Optimal Causal Multicast Algorithm: A Statistical Analysis

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The classical Ricart-Agrawala algorithm (RA) has long been considered the most efficient fair mutual exclusion algorithm in distributed message-passing systems. The algorithm requires 2(N – 1) messages per critical section access, where N is the number of processes in the system. Recently, Lodha-Kshemkalyani proposed an improved fair algorithm (LK) that requires between N and 2(N – 1) messages per critical section access, and without any extra overhead. The exact number of messages depends on the concurrency of requests, and is difficult to prove or analyze theoretically. This paper shows the superior performance of LK over RA using extensive simulations under a wide range of critical section access patterns and network loads.