Skip to main content
Conference ProceedingsOPEN ACCESS

Consensus hierarchy is not robust

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (1997) 279
13Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.

Abstract

It is shown that consensus hierarchy is not robust if object types are allowed to be infinite branching. To avoid the possibility of wait-free algorithms with unbounded running times when using infinite objects, a slightly modified definition of wait-freedom is used. Key and Lock are used to solve consensus for any number of processes, showing consensus hierarchy is not robust.

Cite

CITATION STYLE

APA

Schenk, E. (1997). Consensus hierarchy is not robust. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (p. 279). ACM.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free