Protocols that solve agreement problems are essential building blocks for fault tolerant distributed systems. While many protocols have been published, little has been done to ana...
We present an algorithm implementing the failure detector class omega (Ω) in the crash-recovery model to coordinate data aggregation in wireless sensor networks. In order to mini...
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...