Searching for "A Fast Mutual Exclusion Algorithm." – sorted by Relevance.
-
A Fast Mutual Exclusion Algorithm
- A Fast Mutual Exclusion Algorithm Leslie Lamport November 14, 1985 revised October 31, 1986
- Cited by 182 (7 self) – Add To MetaCart
-
Formal Methods for Dependable Real-Time Systems
- (1):52--78, January 1985. [18] Leslie Lamport. A fast mutual exclusion algorithm. ACM Transactions on Computer Systems
- Cited by 1 (0 self) – Add To MetaCart
-
Dynamic Fast and Long-Lived Renaming (Extended Abstract)
- Introduction In 1987 Lamport [Lam87] has suggested a fast mutual exclusion algorithm in which a processor
- Add To MetaCart
-
Long-Lived Renaming Made Adaptive (Extended Abstract)
- fast mutual exclusion algorithm in which a processor attempting Computer Science Department, Tel
- Add To MetaCart
-
Long-Lived Renaming Made Adaptive
- fast mutual exclusion algorithm in which a processor attempting Computer Science Department, Tel
- Add To MetaCart
-
Long Lived Adaptive Splitter and Applications
- fast mutual exclusion algorithm that allowed a process coming alone to enter the critical section in 7
- Cited by 5 (0 self) – Add To MetaCart
-
How to share a data structure: A fast timing-based solution
- will present a solution by designing a fast wait-free algorithm for mutual exclusion. The model For process
- Cited by 1 (0 self) – Add To MetaCart
-
Speeding Lamport's fast mutual exclusion algorithm
- Introduction In [Lam87], Lamport presents a fast mutual exclusion algorithm, with time complexity — the number
- Cited by 30 (2 self) – Add To MetaCart
-
Time-Adaptive Algorithms for Synchronization
- number of competing processes [Dij65]. A mutual exclusion algorithm satisfies the fast access property
- Cited by 29 (5 self) – Add To MetaCart
-
Long Lived and Adaptive Shared Memory Implementations
- and Shavit used Lamport's technique to generate a fast mutual exclusion algorithm in a real-time environment
- Cited by 1 (0 self) – Add To MetaCart

