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...
Uloženo v:
| Hlavní autor: | |
|---|---|
| Další autoři: | , , |
| Médium: | article |
| Vydáno: |
2014
|
| Témata: | |
| On-line přístup: | http://dspace.utpl.edu.ec/handle/123456789/19126 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|