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

DOI10.1007/BF01187073zbMath0766.68003OpenAlexW2069716047MaRDI QIDQ4031320

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

distributed systemsrandomized algorithmconsensus problemmessage-passing modelshared-memory modelschematic algorithmprocessor renaming problem

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (4)

Tight Bounds for Asynchronous Renaming ⋮ Renaming in synchronous message passing systems with Byzantine failures ⋮ Randomized two-process wait-free test-and-set ⋮ Strong order-preserving renaming in the synchronous message passing model

Cites Work

• Unnamed Item
• On interprocess communication. I: Basic formalism
• Flipping Persuasively in Constant Time
• Renaming in an asynchronous environment
• Fast randomized consensus using shared memory
• Impossibility of distributed consensus with one faulty process
• On the minimal synchronism needed for distributed consensus
• Simple constant-time consensus protocols in realistic failure models
• Reaching Agreement in the Presence of Faults
• A Distributed Algorithm for Minimum-Weight Spanning Trees

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