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...
Gorde:
| Egile nagusia: | |
|---|---|
| Beste egile batzuk: | , , |
| Formatua: | article |
| Argitaratua: |
2014
|
| Gaiak: | |
| Sarrera elektronikoa: | http://dspace.utpl.edu.ec/handle/123456789/19126 |
| Etiketak: |
Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|