37 search results - page 1 / 8 » Bounds for Mutual Exclusion with only Processor Consistency |
110
Voted
WDAG
2000
Springer
15 years 7 months ago
2000
Springer
149
Voted
DC
2010
14 years 10 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...
130
Voted
SIROCCO
2008
15 years 5 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. ...
118
Voted
SSS
2007
Springer
15 years 9 months ago
2007
Springer
In [Dij74] Dijkstra introduced the notion of self-stabilizing algorithms, and presented three such algorithms for the problem of mutual exclusion on a ring of processors. The thir...
114
click to vote
PODC
2009
ACM
16 years 4 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...