Null Messages, Information and Coordination

Raïssa Nataf, Guy Goren, Yoram Moses

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper investigates the role that null messages play in synchronous systems with and without failures, and provides necessary and sufficient conditions on the structure of protocols for information transfer and coordination there. We start by introducing a new and more refined definition of null messages. A generalization of message chains that allow these null messages is provided, and is shown to be necessary and sufficient for information transfer in reliable systems. Coping with crash failures requires a much richer structure, since not receiving a message may be the result of the sender's failure. We introduce a class of communication patterns called resilient message blocks, which impose a stricter condition on protocols than the silent choirs of Goren and Moses (2020). Such blocks are shown to be necessary for information transfer in crash-prone systems. Moreover, they are sufficient in several cases of interest, in which silent choirs are not. Finally, a particular combination of resilient message blocks is shown to be necessary and sufficient for solving the Ordered Response coordination problem.

Original languageEnglish
Title of host publication37th International Symposium on Distributed Computing, DISC 2023
EditorsRotem Oshman
ISBN (Electronic)9783959773010
DOIs
StatePublished - Oct 2023
Event37th International Symposium on Distributed Computing, DISC 2023 - L'Aquila, Italy
Duration: 10 Oct 202312 Oct 2023

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume281

Conference

Conference37th International Symposium on Distributed Computing, DISC 2023
Country/TerritoryItaly
CityL'Aquila
Period10/10/2312/10/23

Keywords

  • coordination
  • fault tolerance
  • information flow
  • knowledge analysis
  • null messages

All Science Journal Classification (ASJC) codes

  • Software

Cite this