Sciweavers

37 search results - page 1 / 8
» Bounds for Mutual Exclusion with only Processor Consistency
Sort
View
DC
2010
13 years 6 days ago
Closing the complexity gap between FCFS mutual exclusion and mutual exclusion
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...
Robert Danek, Wojciech M. Golab
SIROCCO
2008
13 years 6 months ago
On the Performance of Beauquier and Debas' Self-stabilizing Algorithm for Mutual Exclusion
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. ...
Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks
SSS
2007
Springer
106views Control Systems» more  SSS 2007»
13 years 11 months ago
On the Performance of Dijkstra's Third Self-stabilizing Algorithm for Mutual Exclusion
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...
Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks
PODC
2009
ACM
14 years 5 months ago
Randomized mutual exclusion in O(log N / log log N) RMRs
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...
Danny Hendler, Philipp Woelfel