Abstract
The general omissions failure model, in which a faulty process may omit both to send and to receive messages is inherently more complex than the more popular sending omissions model. This fact is exemplified in tasks involving simultaneous decisions, such as the simultaneous consensus (SC) problem. While efficient polynomial protocols for SC that are optimal in all runs are known for the sending omissions model, they do not exists for general omissions. It has been shown that such a protocol must perform at least NP-hard computations (in the number of processes n) between rounds. In fact, the best previously known SC protocol that is optimal in all runs in this model performs PSPACE (in n) computations between rounds. The current paper closes this twenty-year old gap by presenting such an optimal SC protocol that performs P NP computations (polynomial-time computations using an oracle for NP; in fact, a constant number of accesses to the oracle are needed per round.) The result is based on a new characterization of common knowledge in the general omissions failure model.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berman, P., Garay, J.A.: Cloture Votes: n/4-Resilient Distributed Consensus in t + 1 Rounds. Math. Syst. Theo. 26(1), 3–19 (1993); SIAM J. Comput. 27(1), 247–290 (1998)
Burns, J.E., Lynch, N.A.: The Byzantine Firing Squad Problem. Technical Report MIT/LCS/TM-275 (1985)
Charron-Bost, B., Schiper, A.: The Heard-of Model: Computing in Distributed Systems with Benign Faults. Distributed Computing (published online) (July 2009)
Coan, B.A., Dolev, D., Dwork, C., Stockmeyer, L.J.: The Distributed Firing Squad Problem. SIAM J. Comput. 18(5), 990–1012 (1989)
Dolev, D., Reischuk, R., Strong, H.R.: Eventual is Earlier than Immediate. In: Proc. 23rd IEEE Symp. on Foundations of Computer Science, pp. 196–203 (1982)
Dwork, C., Moses, Y.: Knowledge and Common Knowledge in a Byzantine Environment: Crash failures. Information and Computation 88(2), 156–186 (1990)
Garay, J.A., Moses, Y.: Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds. SIAM J. Comput. 27(1), 247–290 (1998)
Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning about Knowledge. MIT Press, Cambridge (1995 revised 2003)
Fischer, M.J., Lynch, N.A., Merritt, M.: Easy Impossibility Proofs for Distributed Consensus Problems. J. ACM 34(1), 98–115 (1987)
Halpern, J.Y., Moses, Y.: Knowledge and Common Knowledge in a Distributed Environment. J. ACM 37(3), 549–587 (1990)
Merritt, M.J.: Unpublished notes on the Dolev-Strong lower bound for Byzantine Agreement (1984)
Michel, R.: A Categorical Approach to Distributed Systems Expressibility and Knowledge. In: Proc. 8th Symp. Princ. Dist. Comp. (PODC), pp. 129–143 (1989)
Mizrahi, T., Moses, Y.: Continuous Consensus via Common Knowledge. Distributed Computing 20(5), 305–321 (2008)
Mizrahi, T., Moses, Y.: Continuous consensus with failures and recoveries. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol. 5218, pp. 408–422. Springer, Heidelberg (2008)
Mizrahi, T., Moses, Y.: Continuous Consensus with Ambiguous Failures. In: Proc. ICDCN, pp. 73–85 (2008)
Moses, Y., Raynal, M.: Revisiting Simultaneous Consensus with Crash Failures. J. Par. Dist. Comp. 69, 400–409 (2009)
Moses, Y., Tuttle, M.R.: Programming simultaneous actions using common knowledge. Algorithmica 3, 121–169 (1988)
Moses, Y., Waarts, O.: Coordinated Traversal: (t + 1)-round Byzantine Agreement in Polynomial Time. J. Algorithms 17(1), 110–156 (1994)
Neiger, G., Bazzi, R.A.: Using Knowledge to Optimally Achieve Coordination in Distributed Systems. Theor. Comput. Sci. 220(1), 31–65 (1999)
Neiger, G., Tuttle, M.R.: Common Knowledge and Consistent Simultaneous Coordination. Distributed Computing 6(3), 181–192 (1993)
Pease, M., Shostak, R., Lamport, L.: Reaching Agreement in the Presence of Faults. Journal of the ACM 27(2), 228–234 (1980)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moses, Y. (2009). Optimum Simultaneous Consensus for General Omissions Is Equivalent to an NP Oracle. In: Keidar, I. (eds) Distributed Computing. DISC 2009. Lecture Notes in Computer Science, vol 5805. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04355-0_45
Download citation
DOI: https://doi.org/10.1007/978-3-642-04355-0_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04354-3
Online ISBN: 978-3-642-04355-0
eBook Packages: Computer ScienceComputer Science (R0)