7 search results - page 1 / 2 » Self-Stabilizing Mutual Exclusion Under Arbitrary Scheduler |
CJ
2004
13 years 4 months ago
2004
IPPS
2000
IEEE
13 years 9 months ago
2000
IEEE
A self-stabilizing algorithm, regardless of the initial system state, converges in finite time to a set of states that satisfy a legitimacy predicate without the need for explici...
OPODIS
2010
13 years 2 months ago
2010
We consider the problem of scheduling dependent real-time tasks for overloads on a multiprocessor system, yielding best-effort timing assurance. The application/scheduling model in...
SPAA
2009
ACM
14 years 5 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...
PODC
1999
ACM
13 years 9 months ago
1999
ACM
We study the memory requirements of self-stabilizing leader election (SSLE) protocols. We are mainly interested in two types of systems: anonymous systems and id-based systems. We...