Observatorio de I+D+i UPM

Memorias de investigación
Communications at congresses:
Agreement in wider environments with weaker assumptions.
Year:2012
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 do 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
XX Jornadas de Concurrencia y Sistemas Distribuidos (JCSD 2012)
960
Place
Pamplona, Spain
Reviewers
No
ISBN/ISSN
Start Date
13/06/2012
End Date
15/06/2012
From page
To page
NO HAY ACTA
Participants
  • Autor: Sergio Arevalo Viñuales (UPM)
  • Autor: Jose Ernesto Jimenez Merino (UPM)
  • Autor: Jian Tang
Research Group, Departaments and Institutes related
  • Creador: Grupo de Investigación: Laboratorio de sistemas distribuidos (LSD)
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)