A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment

DOI10.1007/BF01187073MaRDI QIDQ4031320zbMATH OpenOpenAlexFDO

Authors Amotz Bar-Noy, Danny Dolev

Publication date 1 April 1993

Published in Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01187073

zbMATH Keywords

randomized algorithmdistributed systemsconsensus problemmessage-passing modelshared-memory modelschematic algorithmprocessor renaming problem

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Sharing memory robustly in message-passing systems
• Possibility and impossibility results in a shared memory environment
• Renaming in an asynchronous environment
• scientific article; zbMATH DE number 177544
• Randomized protocols for asynchronous consensus

Cites work

• scientific article; zbMATH DE number 3819094 (Why is no real title available?)
• A Distributed Algorithm for Minimum-Weight Spanning Trees
• Fast randomized consensus using shared memory
• Flipping Persuasively in Constant Time
• Impossibility of distributed consensus with one faulty process
• On interprocess communication. I: Basic formalism
• On the minimal synchronism needed for distributed consensus
• Reaching Agreement in the Presence of Faults
• Renaming in an asynchronous environment
• Simple constant-time consensus protocols in realistic failure models

Cited in

(10)

• Renaming in synchronous message passing systems with Byzantine failures
• Tight bounds for asynchronous renaming
• An asynchronous protocol for release consistent distributed shared memory systems
• Reconfigurable broadcast networks and asynchronous shared-memory systems are equivalent
• scientific article; zbMATH DE number 4001466 (Why is no real title available?)
• Efficient and robust sharing of memory in message-passing systems (extended abstract)
• Emulating shared-memory do-all algorithms in asynchronous message-passing systems
• Randomized two-process wait-free test-and-set
• Passing messages while sharing memory
• Strong order-preserving renaming in the synchronous message passing model

This page was built for publication: A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment

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