Abstract
We consider an asynchronous shared memory system of n processes where processes may experience weak crash fail- ures. A crash m-failure is a crash failure of a process that may occurs only while the point contention is at most m. It is known that there is no consensus algorithm for n pro- cesses using registers that can tolerate even a single crash n-failure. Is there a consensus algorithm for n processes us- ing registers that can tolerate a single crash (n..1)-failure? It is known that there is no κ-set consensus algorithm for n > κ processes using registers that can tolerate κ crash n-failures. How may crash (n - l)-failures can a κ-set con- sensus algorithm using registers tolerate, as a function of n, κ and l? Answers to these questions follow from our results regarding the ability to tolerate weak crash failures.
| Original language | English |
|---|---|
| Title of host publication | PODC 2016 - Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing |
| Publisher | Association for Computing Machinery |
| Pages | 349-351 |
| Number of pages | 3 |
| ISBN (Electronic) | 9781450339643 |
| DOIs | |
| State | Published - 25 Jul 2016 |
| Externally published | Yes |
| Event | 35th ACM Symposium on Principles of Distributed Computing, PODC 2016 - Chicago, United States Duration: 25 Jul 2016 → 28 Jul 2016 |
Publication series
| Name | Proceedings of the Annual ACM Symposium on Principles of Distributed Computing |
|---|---|
| Volume | 25-28-July-2016 |
Conference
| Conference | 35th ACM Symposium on Principles of Distributed Computing, PODC 2016 |
|---|---|
| Country/Territory | United States |
| City | Chicago |
| Period | 25/07/16 → 28/07/16 |
Bibliographical note
Publisher Copyright:© 2016 ACM.