Authors
Mikel Larrea, Sergio Arévalo, Antonio Fernndez
Publication date
1999/9/27
Conference
International Symposium on Distributed Computing
Pages
34-49
Publisher
Springer, Berlin, Heidelberg
Description
Unreliable failure detectors, proposed by Chandra and Toueg [2], are mechanisms that provide information about process fail- ures. In [2], eight classes of failure detectors were de.ned, depending on how accurate this information is, and an algorithm implementing a fail- ure detector of one of these classes in a partially synchronous system was presented. This algorithm is based on all-to-all communication, and peri- odically exchanges a number of messages that is quadratic on the number of processes. To our knowledge, no other algorithm implementing these classes of unreliable failure detectors has been proposed.
In this paper, we present a family of distributed algorithms that imple- ment four classes of unreliable failure detectors in partially synchronous systems. Our algorithms are based on a logical ring arrangement of the processes, which defines the monitoring and failure information …
Total citations
199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202314438109811931354325611236
Scholar articles
M Larrea, S Arévalo, A Fernndez - … Computing: 13th International Symposium, DISC'99 …, 1999