Observatorio de I+D+i UPM

Memorias de investigación
Communications at congresses:
Set Agreement and the Loneliness Failure Detector in Crash-Recovery Systems
Year:2013
Research Areas
  • Information technology and adata processing
Information
Abstract
The set agreement problem states that from n proposed values at most n?1 can be decided. Traditionally, this problem is solved using a failure detector in asynchronous systems where processes may crash but not recover, where processes have different identities, and where all processes initially know the membership. In this paper we study the set agreement problem and the weakest failure detector L used to solve it in asynchronous message passing systems where processes may crash and recover, with homonyms (i.e., processes may have equal identities) and without a complete initial knowledge of the membership.
International
Si
Congress
The International Conference on NETworked sYStems (NETYS 2013),
960
Place
Morocco
Reviewers
Si
ISBN/ISSN
978-3-642-40147-3
10.1007/978-3-642-40148-0_2
Start Date
02/05/2013
End Date
04/05/2013
From page
13
To page
27
Lecture Notes in Computer Science
Participants
  • Autor: Sergio Arevalo Viñuales (UPM)
  • Autor: Jose Ernesto Jimenez Merino (UPM)
  • Autor: Jiang Tang
Research Group, Departaments and Institutes related
  • Creador: Grupo de Investigación: Laboratorio de sistemas distribuidos (LSD)
  • Departamento: Informática Aplicada
S2i 2020 Observatorio de investigación @ UPM con la colaboración del Consejo Social UPM
Cofinanciación del MINECO en el marco del Programa INNCIDE 2011 (OTR-2011-0236)
Cofinanciación del MINECO en el marco del Programa INNPACTO (IPT-020000-2010-22)