Brief Announcement: A Family of Leaderless Generalized-Consensus Algorithms
Abstract
References
Index Terms
- Brief Announcement: A Family of Leaderless Generalized-Consensus Algorithms
Recommendations
Brief announcement: byzantine agreement with homonyms
SPAA '10: Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architecturesIn this work, we address Byzantine agreement in a message passing system with homonyms, i.e. a system with a number l of authenticated identities that is independent of the total number of processes n, in the presence of t < n Byzantine processes.
We ...
Brief announcement: gracefully degrading consensus and k-set agreement under dynamic link failures
PODC '14: Proceedings of the 2014 ACM symposium on Principles of distributed computingWe present a k-set agreement algorithm for synchronous dynamic distributed systems with unidirectional links controlled by an omniscient adversary. Our algorithm automatically adapts to the actual network properties: If the network is sufficiently well-...
Brief announcement: weakest failure detectors via an egg-laying simulation
PODC '09: Proceedings of the 28th ACM symposium on Principles of distributed computingIn the k-set agreement task, n processes propose values, and have to decide on at most k of these values. In particular, consensus is 1-set agreement. In PODC 2008 Zieliński showed that the anti-Ω failure detector is necessary and sufficient to solve (n ...
Comments
Information & Contributors
Information
Published In
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Announcement
Funding Sources
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 406Total Downloads
- Downloads (Last 12 months)27
- Downloads (Last 6 weeks)3
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in