18 search results - page 1 / 4 » Closing the complexity gap between FCFS mutual exclusion and... |
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...
TRIDENTCOM
2006
IEEE
13 years 10 months ago
2006
IEEE
– This paper presents a reliable decentralized mutual exclusion algorithm for distributed systems in which processes communicate by asynchronous message passing. When any failure...
CONPAR
1992
13 years 8 months ago
1992
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
EUROPAR
2006
Springer
13 years 8 months ago
2006
Springer
This paper is motivated by a need of practical asynchronous network systems, i.e., a wait-free distributed mutual exclusion algorithm (WDME). The WDME algorithm is very appealing w...
AAMAS
2000
Springer
13 years 4 months ago
2000
Springer
Hospital Patient Scheduling is an inherently distributed problem because of the way real hospitals are organized. As medical procedures have become more complex, and their associat...