32 search results - page 1 / 7 » Randomized mutual exclusion in O(log N log log N) RMRs |
PODC
2009
ACM
14 years 5 months ago
2009
ACM
d Abstract] Danny Hendler Department of Computer-Science Ben-Gurion University hendlerd@cs.bgu.ac.il Philipp Woelfel Department of Computer-Science University of Calgary woelfel@cp...
PODC
2010
ACM
13 years 9 months ago
2010
ACM
Mutual exclusion is a fundamental distributed coordination problem. Shared-memory mutual exclusion research focuses on local-spin algorithms and uses the remote memory references ...
DC
2010
13 years 8 days ago
2010
First-Come-First-Served (FCFS) mutual exclusion (ME) is the problem of ensuring that processes attempting to concurrently access a shared resource do so one by one, in a fair order...
PODC
2006
ACM
13 years 11 months ago
2006
ACM
ECCC
2011
13 years 9 days ago
2011
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...