scientific article; zbMATH DE number 177544

MaRDI QIDQ4037413zbMATH OpenFDO

Authors Oscar Aguilar, Ajoy K. Datta, Sukumar Ghosh

Publication date 18 May 1993

zbMATH Keywords

asynchronous systemsatomicitymessage passingmutual exclusionrandomized consensus algorithmsread-modify-write registersresilienceshared memorysynchronization primitives

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Sharing memory robustly in message-passing systems
• Practically stabilizing SWMR atomic memory in message-passing systems
• Efficient and Robust Sharing of Memory in Message-Passing Systems
• Reliable shared memory abstraction on top of asynchronous Byzantine message-passing systems
• Simulating a shared register in an asynchronous system that never stops changing (extended abstract)

Cited in

(9)

• An asynchronous protocol for release consistent distributed shared memory systems
• Simulating a shared register in an asynchronous system that never stops changing (extended abstract)
• Cooperative asynchronous update of shared memory
• A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment
• Sharing memory robustly in message-passing systems
• Efficient and Robust Sharing of Memory in Message-Passing Systems
• Dynamic Task Allocation in Asynchronous Shared Memory
• Efficient and robust sharing of memory in message-passing systems (extended abstract)
• Emulating shared-memory do-all algorithms in asynchronous message-passing systems

This page was built for publication:

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