Failure detectors in homonymous distributed systems (with an application to consensus)

Arévalo Viñuales, Sergio and Jiménez Merino, José Ernesto and Fernández Anta, Antonio and Imbs, Damien and Raynal, Michel (2015). Failure detectors in homonymous distributed systems (with an application to consensus). "Journal of parallel and distributed computing", v. 83 ; pp. 83-95. ISSN 0743-7315. https://doi.org/10.1016/j.jpdc.2015.05.007.

Description

Title: Failure detectors in homonymous distributed systems (with an application to consensus)
Author/s:
  • Arévalo Viñuales, Sergio
  • Jiménez Merino, José Ernesto
  • Fernández Anta, Antonio
  • Imbs, Damien
  • Raynal, Michel
Item Type: Article
Título de Revista/Publicación: Journal of parallel and distributed computing
Date: September 2015
ISSN: 0743-7315
Volume: 83
Subjects:
Freetext Keywords: Agreement problem, asynchrony, consensus, distributed computability, failure detector, homonymous systems, message-passing, process crash
Faculty: E.T.S.I. de Sistemas Informáticos (UPM)
Department: Sistemas Informáticos
Creative Commons Licenses: Recognition - No derivative works - Non commercial

Full text

[img]
Preview
PDF - Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (5MB) | Preview

Abstract

ABSTRACT This paper is on homonymous distributed systems where processes are prone to crash failures and have no initial knowledge of the system membership (‘‘homonymous’’ means that several processes may have the same identifier). New classes of failure detectors suited to these systems are first defined. Among them, the classes HΩ and HΣ are introduced that are the homonymous counterparts of the Classes Ω and Σ, respectively. (Recall that the pair ⟨Ω, Σ⟩ defines the weakest failure detector to solve consensus.) Then, the paper shows how HΩ and HΣ can be implemented in homonymous systems without membership knowledge (under different synchrony requirements). Finally, two algorithms are presented that use these failure detectors to solve consensus in homonymous asynchronous systems where there is no initial knowledge of the membership. One algorithm solves consensus with ⟨HΩ, HΣ⟩, while the other uses only HΩ, but needs a majority of correct processes. Observe that the systems with unique identifiers and anonymous systems are extreme cases of homonymous systems from which follows that all these results also apply to these systems. Interestingly, the new failure detector class HΩ can be implemented with partial synchrony (i.e., all messages sent after some bounded time GST will be received after at most an unknown bounded latency δ), while the analogous class AΩ defined for anonymous systems cannot be implemented (even in synchronous systems). Hence, the paper provides the first consensus algorithm for anonymous systems with this model of partial synchrony and a majority of correct processes.

Funding Projects

TypeCodeAcronymLeaderTitle
Government of SpainTIN2013-46883BigDataPaaSUnspecifiedUnspecified
Madrid Regional GovernmentS2013/ICE-2894Cloud4BigDataUnspecifiedUnspecified

More information

Item ID: 40480
DC Identifier: http://oa.upm.es/40480/
OAI Identifier: oai:oa.upm.es:40480
DOI: 10.1016/j.jpdc.2015.05.007
Official URL: http://www.sciencedirect.com/science/article/pii/S0743731515000970
Deposited by: Memoria Investigacion
Deposited on: 07 Apr 2017 19:40
Last Modified: 05 Jun 2019 13:40
  • Logo InvestigaM (UPM)
  • Logo GEOUP4
  • Logo Open Access
  • Open Access
  • Logo Sherpa/Romeo
    Check whether the anglo-saxon journal in which you have published an article allows you to also publish it under open access.
  • Logo Dulcinea
    Check whether the spanish journal in which you have published an article allows you to also publish it under open access.
  • Logo de Recolecta
  • Logo del Observatorio I+D+i UPM
  • Logo de OpenCourseWare UPM