Tushar Deepak Chandra and Sam Toueg (Distributed Locking Algorithms Distributed Locking Algorithms)
Jump to navigation
Jump to search
Time Complexity
$O(n)$
Space Complexity
()
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Year
1996
Reference
https://www.cs.utexas.edu/~lorenzo/corsi/cs380d/papers/p225-chandra.pdf