Efficient and Robust Sharing of Memory in Message-Passing Systems

DOI10.1006/JAGM.1999.1025MaRDI QIDQ4943072zbMATH OpenOpenAlexFDO

Authors Hagit Attiya

Publication date 16 March 2000

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/db0a59ccdf41f9d5376735c571b6545f8e105203

zbMATH Keywords

asynchronous message passing system

Mathematics Subject Classification ID

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

Recommendations

• Sharing memory robustly in message-passing systems
• Wait-free implementations in message-passing systems
• scientific article; zbMATH DE number 177544
• Emulating shared-memory do-all algorithms in asynchronous message-passing systems
• Robust simulation of shared memory: 20 years after

Cited in

(12)

• Wait-free implementations in message-passing systems
• Simulating a shared register in an asynchronous system that never stops changing (extended abstract)
• Atomic read/write memory in signature-free Byzantine asynchronous message-passing systems
• Robust simulation of shared memory: 20 years after
• The weakest failure detector to implement a register in asynchronous systems with hybrid communication
• scientific article; zbMATH DE number 177544 (Why is no real title available?)
• Sharing memory robustly in message-passing systems
• Constructive, Deterministic Implementation of Shared Memory on Meshes
• Brief Announcement: The MBroadcast Abstraction
• Efficient and robust sharing of memory in message-passing systems (extended abstract)
• Emulating shared-memory do-all algorithms in asynchronous message-passing systems
• A simple proof of the necessity of the failure detector \(\Sigma \) to implement an atomic register in asynchronous message-passing systems

This page was built for publication: Efficient and Robust Sharing of Memory in Message-Passing Systems

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