Sciweavers

77 search results - page 1 / 16
» An improved lower bound for the time complexity of mutual ex...
Sort
View
JPDC
2006
92views more  JPDC 2006»
13 years 10 months ago
A tight bound on remote reference time complexity of mutual exclusion in the read-modify-write model
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 ...
Sheng-Hsiung Chen, Ting-Lu Huang
DC
2010
13 years 5 months 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
14 years 8 days 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
PODC
2009
ACM
14 years 11 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