A failure detector for wireless networks with unknown membership
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part II
What model and what conditions to implement unreliable failure detectors in dynamic networks?
Proceedings of the 3rd International Workshop on Theoretical Aspects of Dynamic Distributed Systems
Specifying and implementing an eventual leader service for dynamic systems
International Journal of Web and Grid Services
| Hi-index | 0.00 |
We study the failure detection problem in a message-passing system that may dynamically change over time, so that the number of processes which make progress during a computation may grow to infinity as time tends to infinity but the number of concurrently up processes do not exceed a known bound. We first propose the specification of a new oracle, called HB*, able to give hints on which processes are making progress in the system. A possible HB* implementation is given. Then, we show how to use HB* to implement the oracle Ω that eventually identifies a unique leader in the system. To the best of our knowledge this is the first implementation of Ω running in a message passing system with infinitely many processes.