skip to main content
10.1145/3583668.3594569acmconferencesArticle/Chapter ViewAbstractPublication PagespodcConference Proceedingsconference-collections
short-paper

Brief Announcement: The MBroadcast Abstraction

Published: 16 June 2023 Publication History

Abstract

This short article presents a new communication abstraction denoted Mutual Broadcast (in short MBroadcast). It provides each pair of processes with the following property (called mutual ordering): for any pair of processes p and p′, if p broadcasts a message m and p′ broadcasts a message m′, it is not possible for p to deliver first (its message) m and then m′ while p′ delivers first (its message) m′ and then m. The computability power of this broadcast abstraction is the same as the one of an atomic read/write register. Interestingly, it constitutes the first characterization of RW registers in terms of (binary) message patterns.

References

[1]
Mustaque Ahamad, Gil Neiger, James E Burns, Prince Kohli, and Phillip W Hutto. 1995. Causal memory: Definitions, implementation, and programming. Distributed Computing 9, 1 (1995), 37--49.
[2]
Hagit Attiya. 2000. Efficient and robust sharing of memory in message-passing systems. Journal of Algorithms 34, 1 (2000), 109--127.
[3]
Hagit Attiya, Amotz Bar-Noy, and Danny Dolev. 1995. Sharing memory robustly in message-passing systems. Journal of the ACM (JACM) 42, 1 (1995), 124--142.
[4]
Kenneth P Birman and Thomas A Joseph. 1987. Reliable communication in the presence of failures. ACM Transactions on Computer Systems (TOCS) 5, 1 (1987), 47--76.
[5]
Mathilde Déprés, Achour Mostefaoui, Matthieu Perrin, and Michel Raynal. 2023. Send/Receive Patterns versus Read/Write Patterns: the MB-Broadcast Abstraction (Extended Version). (May 2023). https://hal.science/hal-04087447 working paper or preprint.
[6]
Vassos Hadzilacos and Sam Toueg. 1994. A modular approach to fault-tolerant broadcasts and related problems. Technical Report. Cornell University.
[7]
Maurice Herlihy, Sergio Rajsbaum, Michel Raynal, and Julien Stainer. 2017. From wait-free to arbitrary concurrent solo executions in colorless distributed computing. Theoretical Computer Science 683 (2017), 1--21.
[8]
Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, and Michel Raynal. 2021. Set-constrained delivery broadcast: A communication abstraction for read/write implementable distributed objects. Theoretical Computer Science 886 (2021), 49--68.
[9]
Achour Mostéfaoui and Michel Raynal. 2016. Two-bit messages are sufficient to implement atomic read/write registers in crash-prone systems. In Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing. ACM, 381--389.
[10]
Achour Mostéfaoui, Michel Raynal, and Matthieu Roy. 2019. Time-efficient read/write register in crash-prone asynchronous message-passing systems. Computing 101 (2019), 3--17.
[11]
Michel Raynal. 2018. Fault-tolerant message-passing distributed systems: an algorithmic approach. Springer.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
PODC '23: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing
June 2023
392 pages
ISBN:9798400701214
DOI:10.1145/3583668
Publication rights licensed to ACM. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of a national government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 16 June 2023

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. asynchrony
  2. atomicity
  3. broadcast abstraction
  4. characterization
  5. crash failure
  6. distributed computability
  7. message-passing
  8. message pattern
  9. quorum
  10. read/write pattern
  11. read/write register
  12. two-process communication

Qualifiers

  • Short-paper

Funding Sources

  • ANR

Conference

PODC '23
Sponsor:

Acceptance Rates

PODC '23 Paper Acceptance Rate 29 of 110 submissions, 26%;
Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 57
    Total Downloads
  • Downloads (Last 12 months)14
  • Downloads (Last 6 weeks)0
Reflects downloads up to 20 Feb 2025

Other Metrics

Citations

Cited By

View all

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media