Failure detectors for wireless sensor-actuator systems
Ad Hoc Networks
The weakest failure detector for wait-free dining under eventual weak exclusion
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Brief announcement: wait-free dining for eventual weak exclusion
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Wait-free dining under eventual weak exclusion
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Dynamic FTSS in asynchronous systems: The case of unison
Theoretical Computer Science
Eventually perfect failure detectors using ADD channels
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
| Hi-index | 0.00 |
Ideally, distributed algorithms isolate the side-effects of faults within local neighborhoods of impact. Failure locality quantifies this concept as the maximum radius of impact caused by a given fault. We present new locality results for the dining philosophers problem subject to crash failures. The optimal crash locality for dining is 0 in synchronous networks, but degrades to 2 in asynchronous networks. Using the eventually-perfect failure detector 驴P , we construct the first known dining algorithms with crash locality 1 under partial synchrony. These algorithms close the failure-locality complexity gap and improve the crash tolerance of resource allocation algorithms in practical networks. We prove the optimality of our results with two fundamental theorems. First, no dining solution using 驴P achieves locality 0. Second, 驴P is the weakest failure detector in the Chandra-Toueg hierarchy to realize locality 1.