120 search results - page 1 / 24 » The Weak Mutual Exclusion problem |
IPPS
2009
IEEE
14 years 1 months ago
2009
IEEE
In this paper we define the Weak Mutual Exclusion (WME) problem. Analogously to classical Distributed Mutual Exclusion (DME), WME serializes the accesses to a shared resource. Di...
SPAA
2009
ACM
14 years 6 months ago
2009
ACM
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
DC
2010
13 years 1 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...
FLAIRS
2008
13 years 8 months ago
2008
In this paper we describe a class of a problem of goal satisfaction in mutual exclusion network that can be solved in polynomial time. This problem provides a common basis for rea...
FGCS
2010
13 years 4 months ago
2010
In a distributed system where scalability is an issue, like in a GRID [5], the problem of enforcing mutual exclusion often arises in a soft form: the infrequent failure of the mut...