Passing messages while sharing memory

DOI10.1145/3212734.3212741MaRDI QIDQ5197667zbMATH OpenOpenAlexFDO

Authors Naama Ben-David, Irina Calciu, Erez Petrank, Sam Toueg, Marcos Kawazoe Aguilera, Rachid Guerraoui

Publication date 19 September 2019

Published in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3212734.3212741

zbMATH Keywords

consensusleader electionexpander graphsshared memorypartial synchronymessage passingdistributed computing models

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• On atomic registers and randomized consensus in m\&m systems
• Sharing memory robustly in message-passing systems
• Possibility and impossibility results in a shared memory environment
• A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment
• Computing with faulty shared memory (extended abstract)

Cited in

(7)

• Distributed computing with the Cloud
• A tight lower bound for 3-coloring grids in the online-LOCAL model
• A calculus for attribute-based memory updates
• On atomic registers and randomized consensus in m\&m systems
• AbU: a calculus for distributed event-driven programming with attribute-based interaction
• Optimal resilience in systems that mix shared memory and message passing
• An operational semantics for shared messaging communication

This page was built for publication: Passing messages while sharing memory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5197667)