6 search results - page 1 / 2 » A tight bound on remote reference time complexity of mutual ... |
JPDC
2006
2006
A tight bound on remote reference time complexity of mutual exclusion in the read-modify-write model
13 years 4 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 ...
DC
2010
12 years 11 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...
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 8 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 ...
PODC
2010
ACM
13 years 4 months ago
2010
ACM
Mutual exclusion is used to coordinate access to shared resources by concurrent processes. k-Exclusion is a variant of mutual exclusion in which up to k processes can simultaneous...