Set Agreement and the Loneliness Failure Detector in Crash-Recovery Systems
The set agreement problem requires 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...
Salvato in:
| Autore principale: | |
|---|---|
| Altri autori: | , , |
| Natura: | article |
| Pubblicazione: |
2014
|
| Soggetti: | |
| Accesso online: | http://dspace.utpl.edu.ec/handle/123456789/19126 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|