{rfName}
Im

License and Use

Icono OpenAccess

Altmetrics

Analysis of institutional authors

Arevalo, SAuthor

Share

January 8, 2026
Publications
>
Article

Implementing the weakest failure detector for solving the consensus problem

Publicated to: International Journal of Parallel, Emergent and Distributed Systems. 28 (6): 537-555 - 2013-01-01 28(6), DOI: 10.1080/17445760.2012.753180

Authors:

Larrea, M; Anta, AF; Arévalo, S
[+]

Affiliations

Inst IMDEA Networks - Author
Univ Basque Country, UPV EHU - Author
Univ Politecn Madrid - Author
See more

Abstract

The concept of unreliable failure detector was introduced by Chandra and Toueg as a mechanism that provides information about process failures. This mechanism has been used to solve several agreement problems, such as the consensus problem. In this paper, algorithms that implement failure detectors in partially synchronous systems are presented. First two simple algorithms of the weakest class to solve the consensus problem, namely the Eventually Strong class (lozenge S), are presented. While the first algorithm is wait-free, the second algorithm is f-resilient, where f is a known upper bound on the number of faulty processes. Both algorithms guarantee that, eventually, all the correct processes agree permanently on a common correct process, i.e. they also implement a failure detector of the class Omega (Omega). They are also shown to be optimal in terms of the number of communication links used forever. Additionally, a wait-free algorithm that implements a failure detector of the Eventually Perfect class (lozenge P) is presented. This algorithm is shown to be optimal in terms of the number of bidirectional links used forever.
[+]

Keywords

ConsensusDistributed computingFailure detectorFault-toleranceOmegaPartial synchronyTime-free

Quality index

Bibliometric impact. Analysis of the contribution and dissemination channel

The work has been published in the journal International Journal of Parallel, Emergent and Distributed Systems, Q3 Agency Scopus (SJR), its regional focus and specialization in Computer Networks and Communications, give it significant recognition in a specific niche of scientific knowledge at an international level.

Independientemente del impacto esperado determinado por el canal de difusión, es importante destacar el impacto real observado de la propia aportación.

Según las diferentes agencias de indexación, el número de citas acumuladas por esta publicación hasta la fecha 2026-04-25:

  • WoS: 4
  • Scopus: 7
[+]

Impact and social visibility

From the perspective of influence or social adoption, and based on metrics associated with mentions and interactions provided by agencies specializing in calculating the so-called "Alternative or Social Metrics," we can highlight as of 2026-04-25:

  • The use of this contribution in bookmarks, code forks, additions to favorite lists for recurrent reading, as well as general views, indicates that someone is using the publication as a basis for their current work. This may be a notable indicator of future more formal and academic citations. This claim is supported by the result of the "Capture" indicator, which yields a total of: 6 (PlumX).

It is essential to present evidence supporting full alignment with institutional principles and guidelines on Open Science and the Conservation and Dissemination of Intellectual Heritage. A clear example of this is:

  • The work has been submitted to a journal whose editorial policy allows open Open Access publication.
  • Assignment of a Handle/URN as an identifier within the deposit in the Institutional Repository: https://oa.upm.es/25858/

As a result of the publication of the work in the institutional repository, statistical usage data has been obtained that reflects its impact. In terms of dissemination, we can state that, as of

  • Views: 426
  • Downloads: 371
[+]

Leadership analysis of institutional authors

There is a significant leadership presence as some of the institution’s authors appear as the first or last signer, detailed as follows: Last Author (AREVALO VIÑUALES, SERGIO).

[+]