Reliable Shared Memory Abstraction on Top of Asynchronous Byzantine Message-Passing Systems

DOI10.1007/978-3-319-09620-9_5zbMath1416.68024OpenAlexW152576206MaRDI QIDQ5496147

Damien Imbs, Sergio Rajsbaum, Julien Stainer, Michel Raynal

Publication date: 7 August 2014

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09620-9_5

zbMATH Keywords

distributed computingquorumreliable broadcastasynchronous message-passing systemapproximate agreementatomic read/write registerByzantine process\(t\)-resiliencebroadcast abstractionreliable shared memorysingle-writer/multi-reader register

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (1)

Atomic read/write memory in signature-free Byzantine asynchronous message-passing systems

This page was built for publication: Reliable Shared Memory Abstraction on Top of Asynchronous Byzantine Message-Passing Systems