On implementing SWMR registers from SWSR registers in systems with Byzantine failures

The implementation of registers from (potentially) weaker registers is a classical problem in the theory of distributed computing. Since Lamport’s pioneering work (Lamport in Distrib Comput 1(2):77–101, 1986), this problem has been extensively studied in the context of asynchronous processes with cr...

Full description

Saved in:

Bibliographic Details
Published in:	Distributed computing Vol. 37; no. 2; pp. 145 - 175
Main Authors:	Hu, Xing, Toueg, Sam
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2024 Springer Nature B.V
Subjects:	Computer Communication Networks Computer Hardware Computer Science Computer Systems Organization and Communication Networks Context Distributed processing Failure Registers Signatures Software Engineering/Programming and Operating Systems Theory of Computation Theory of computation Shared registers Concurrency Distributed computing models Linearizability Distributed computing Distributed algorithms
ISSN:	0178-2770, 1432-0452
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!