77 search results - page 1 / 16 » An improved lower bound for the time complexity of mutual ex... |
69
Voted
DC
2002
14 years 10 months ago
2002
91
Voted
JPDC
2006
2006
A tight bound on remote reference time complexity of mutual exclusion in the read-modify-write model
14 years 10 months ago
In distributed shared memory multiprocessors, remote memory references generate processor-to-memory traffic, which may result in a bottleneck. It is therefore important to design ...
101
click to vote
DC
2010
14 years 5 months 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...
SIROCCO
2008
14 years 11 months ago
2008
In [Dij74] Dijkstra introduced the notion of self-stabilizing algorithms and presented an algorithm with three states for the problem of mutual exclusion on a ring of processors. ...
PODC
2009
ACM
15 years 10 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...