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...
Guardado en:
| Autor principal: | |
|---|---|
| Otros Autores: | , , |
| Formato: | article |
| Publicado: |
2014
|
| Materias: | |
| Acceso en línea: | http://dspace.utpl.edu.ec/handle/123456789/19126 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|