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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Distributed computing Ročník 37; číslo 2; s. 145 - 175
Hlavní autoři:	Hu, Xing, Toueg, Sam
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2024 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!