Texto completo
Vista Previa |
PDF (Portable Document Format)
- Se necesita un visor de ficheros PDF, como GSview, Xpdf o Adobe Acrobat Reader
Descargar (310kB) | Vista Previa |
Agreement in wider environments with weaker assumptions.
Cita
Arévalo Viñuales, Sergio 
ORCID: https://orcid.org/0000-0002-0807-0631, Jiménez Merino, José Ernesto ORCID: https://orcid.org/0000-0002-3432-6581 and Tang, Jian
(2012).
Agreement in wider environments with weaker assumptions..
En: "XX Jornadas de Concurrencia y Sistemas Distribuidos (JCSD 2012)", 13/06/2012 - 15/06/2012, Pamplona, Spain. pp..
ORCID: https://orcid.org/0000-0002-0807-0631, Jiménez Merino, José Ernesto ORCID: https://orcid.org/0000-0002-3432-6581 and Tang, Jian
(2012).
Agreement in wider environments with weaker assumptions..
En: "XX Jornadas de Concurrencia y Sistemas Distribuidos (JCSD 2012)", 13/06/2012 - 15/06/2012, Pamplona, Spain. pp..
Descripción
| Título: | Agreement in wider environments with weaker assumptions. |
|---|---|
| Autor/es: |
|
| Tipo de Documento: | Ponencia en Congreso o Jornada (Artículo) |
| Título del Evento: | XX Jornadas de Concurrencia y Sistemas Distribuidos (JCSD 2012) |
| Fechas del Evento: | 13/06/2012 - 15/06/2012 |
| Lugar del Evento: | Pamplona, Spain |
| Título del Libro: | XX Jornadas de Concurrencia y Sistemas Distribuidos (JCSD 2012) |
| Fecha: | 2012 |
| Materias: | |
| ODS: | |
| Escuela: | E.U. de Informática (UPM) [antigua denominación] |
| Departamento: | Informática Aplicada [hasta 2014] |
| Licencias Creative Commons: | Reconocimiento - Sin obra derivada - No comercial |
Resumen
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.
Más información
| ID de Registro: | 19529 |
|---|---|
| Identificador DC: | https://oa.upm.es/19529/ |
| Identificador OAI: | oai:oa.upm.es:19529 |
| Depositado por: | Memoria Investigacion |
| Depositado el: | 25 Mar 2014 12:40 |
| Ultima Modificación: | 21 Abr 2016 19:56 |
Acciones
- Estadísticas
- Exportar cita
- Editar (sólo personal del Archivo)
