LIPIcs.DISC.2022.49.pdf
- Filesize: 468 kB
- 3 pages
Document
Brief Announcement: Null Messages, Information and Coordination
Authors
-
Part of:
Volume:
36th International Symposium on Distributed Computing (DISC 2022)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Symposium on Distributed Computing (DISC) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2022-10-17
Cite As Get BibTex
Raïssa Nataf, Guy Goren, and Yoram Moses. Brief Announcement: Null Messages, Information and Coordination. In 36th International Symposium on Distributed Computing (DISC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 246, pp. 49:1-49:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
https://doi.org/10.4230/LIPIcs.DISC.2022.49
Abstract
This paper investigates how null messages can transfer information in fault-prone synchronous systems. The notion of an f-resilient message block is defined and is shown to capture the fundamental communication pattern for knowledge transfer. In general, this pattern combines both null messages and explicit messages. It thus provides a fault-tolerant extension of the classic notion of a message-chain. Based on the above, we provide tight necessary and sufficient characterizations of the generalized communication patterns that can serve to solve the distributed tasks of (nice-run) Signalling and Ordered Response.
Subject Classification
ACM Subject Classification
- Theory of computation → Distributed algorithms
- Computing methodologies → Reasoning about belief and knowledge
Keywords
- null messages
- fault tolerance
- coordination
- information flow
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
-
Eugene S. Amdur, Samuel M. Weber, and Vassos Hadzilacos. On the message complexity of binary byzantine agreement under crash failures. Distributed Computing, 5(4):175-186, 1992.
-
Ido Ben-Zvi and Yoram Moses. Beyond Lamport’s happened-before: On time bounds and the ordering of events in distributed systems. Journal of the ACM (JACM), 61(2):1-26, 2014.
- Ronald Fagin, Joseph Y Halpern, Yoram Moses, and Moshe Y Vardi. Reasoning About Knowledge. MIT Press, 1995. URL: https://doi.org/10.7551/mitpress/5803.001.0001.
- Guy Goren and Yoram Moses. Silence. J. ACM, 67:3:1-3:26, 2020. URL: https://doi.org/10.1145/3377883.
-
Guy Goren and Yoram Moses. Optimistically tuning synchronous Byzantine consensus: another win for null messages. Distributed Computing, 34(5):395-410, 2021.
-
Vassos Hadzilacos and Joseph Y. Halpern. Message-optimal protocols for byzantine agreement. Mathematical Systems Theory, 26(1):41-102, 1993.
- Leslie Lamport. Using time instead of timeout for fault-tolerant distributed systems. ACM Trans. Program. Lang. Syst., 6:254-280, 1984. URL: https://doi.org/10.1145/2993.2994.
- Raïssa Nataf, Guy Goren, and Yoram Moses. Null messages, information and coordination: Preliminary report. CoRR, abs/2208.10866, 2022. URL: http://arxiv.org/abs/2208.10866.