Efficient and robust sharing of memory in message-passing systems (extended abstract)

DOI10.1007/3-540-61769-8_5MaRDI QIDQ6570911zbMATH OpenFDO

Authors Hagit Attiya

Publication date 11 July 2024

Full work available at URL https://doi.org/10.1007/3-540-61769-8_5

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14)

Recommendations

• Efficient and Robust Sharing of Memory in Message-Passing Systems
• Sharing memory robustly in message-passing systems
• Emulating shared-memory do-all algorithms in asynchronous message-passing systems
• scientific article; zbMATH DE number 177544
• Principles of Distributed Systems

Cites work

• A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment
• Algebraic spans
• Bounded time-stamps
• Constructing 1-writer multireader multivalued atomic variables from regular variables
• Renaming in an asynchronous environment
• Sharing memory robustly in message-passing systems

This page was built for publication: Efficient and robust sharing of memory in message-passing systems (extended abstract)

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