Full text
![[thumbnail of INVE_MEM_2013_163994.pdf]](https://oa.upm.es/style/images/fileicons/application_pdf.png) Preview |
PDF
- Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (382kB) |
Set agreement and the loneliness failure detector in crash-recovery systems
Citation
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
(2013).
Set agreement and the loneliness failure detector in crash-recovery systems.
In: "First International Conference on NETworked sYStems, May 2-4, 2013, Marrakech, Morocco", 02/05/2013 - 04/05/2013, Morocco. ISBN 978-3-642-40147-3. pp. 13-27.
Description
| Title: | Set agreement and the loneliness failure detector in crash-recovery systems |
|---|---|
| Author/s: |
|
| Item Type: | Presentation at Congress or Conference (Article) |
| Event Title: | First International Conference on NETworked sYStems, May 2-4, 2013, Marrakech, Morocco |
| Event Dates: | 02/05/2013 - 04/05/2013 |
| Event Location: | Morocco |
| Title of Book: | Networked Systems : First International Conference, NETYS 2013, Marrakech, Morocco, May 2-4, 2013, revised selected papers |
| Date: | 2013 |
| ISBN: | 978-3-642-40147-3 |
| Volume: | Lectur |
| Subjects: | |
| Faculty: | E.U. de Informática (UPM) |
| Department: | Informática Aplicada [hasta 2014] |
| Creative Commons Licenses: | Recognition - No derivative works - Non commercial |
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.
More information
| Item ID: | 26471 |
|---|---|
| DC Identifier: | https://oa.upm.es/26471/ |
| OAI Identifier: | oai:oa.upm.es:26471 |
| Official URL: | http://www.netys.net/ |
| Deposited by: | Memoria Investigacion |
| Deposited on: | 23 May 2014 15:11 |
| Last Modified: | 22 Sep 2014 11:41 |
