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...
Сохранить в:
| Главный автор: | |
|---|---|
| Другие авторы: | , , |
| Формат: | article |
| Опубликовано: |
2014
|
| Предметы: | |
| Online-ссылка: | http://dspace.utpl.edu.ec/handle/123456789/19126 |
| Метки: |
Добавить метку
Нет меток, Требуется 1-ая метка записи!
|