Paper Info
Title
A performance comparison of fast distributed mutual exclusion algorithms
Abstract
Several fast and low-overhead distributed mutual exclusion algorithms have been proposed. Each of these algorithms required O(log n) messages per critical section entry and O(log n) bits of storage per processor. In this paper, we make a comparative performance study of four distributed mutual exclusion algorithms. Since the algorithms we study are the basis for distributed synchronization, distributed virtual memory, coherent caches, and distributed object systems, our results have implications about the best methods for their implementation. We find that the distributed synchronization algorithm of Chang, Singhal, and Liu (1990) has the overall best performance, though other algorithms are more efficient in special cases. In a system of 350 processors, the CSL algorithm requires only six messages per critical section entry, including the initial request and the token response messages.
Year
DOI
Venue
1995
10.1109/IPPS.1995.395942
IPPS
Keywords
Field
DocType
comparative performance study,overall best performance,csl algorithm,coherent cache,mutual exclusion algorithm,initial request,performance comparison,critical section entry,synchronization algorithm,best method,log n,voting,computational complexity,protocols,distributed algorithms,fault tolerance,critical section,virtual memory
Binary logarithm,Suzuki-Kasami algorithm,Synchronization,Computer science,Virtual memory,Critical section,Parallel computing,Distributed algorithm,Security token,Computational complexity theory
Conference
ISBN
Citations 
PageRank 
0-8186-7074-6
12
0.77
References 
Authors
3
1
Name
Order
Citations
PageRank
Theodore Johnson19735.24