Paper Info
Title
A distributed algorithm for multiple entries to a critical section
Abstract
Ricart and Agrawala's algorithm for distributed mutual exclusion is extended to enable up to K nodes to be within the critical section simultaneously. Our algorithm requires at most 2 ∗ (N−1) messages per entry to the critical section, and occasionally fewer.
Year
DOI
Venue
1989
10.1016/0020-0190(89)90211-1
Inf. Process. Lett.
Keywords
Field
DocType
multiple entry,critical section,distributed algorithm
Discrete mathematics,Synchronization,Suzuki-Kasami algorithm,Computer science,Critical section,Parallel computing,Theoretical computer science,Distributed algorithm,Mutual exclusion
Journal
Volume
Issue
ISSN
30
4
0020-0190
Citations 
PageRank 
References 
56
3.20
4
Authors
1
Name
Order
Citations
PageRank
Kerry Raymond135348.73