Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Petrolia, Matoula"'
To implement a linearizable shared memory in synchronous message-passing systems it is necessary to wait for a time linear to the uncertainty in the latency of the network for both read and write operations. Waiting only for one of them suffices for
Externí odkaz:
http://arxiv.org/abs/1607.06258
It has been proved that to implement a linearizable shared memory in synchronous message-passing systems it is necessary to wait for a time proportional to the uncertainty in the latency of the network for both read and write operations, while waitin
Externí odkaz:
http://arxiv.org/abs/1607.05596
This article presents a signature-free distributed algorithm which builds an atomic read/write shared memory on top of an $n$-process asynchronous message-passing system in which up to $t
Externí odkaz:
http://arxiv.org/abs/1604.08161
Publikováno v:
In Theoretical Computer Science 10 December 2015 608 Part 3:231-254
Publikováno v:
Theory of Computing Systems. May2017, Vol. 60 Issue 4, p677-694. 18p.
This article presents a signature-free distributed algorithm which builds an atomic read/write shared memory on top of an n-process asynchronous message-passing system in which up to t < n/3 processes may commit Byzantine failures. From a conceptual
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::4b33e092fd6dc22ff3ea69c0952fb80c
https://hal.inria.fr/hal-01238765/file/RR-2028-SeqNb-Byz-memmory.pdf
https://hal.inria.fr/hal-01238765/file/RR-2028-SeqNb-Byz-memmory.pdf
Publikováno v:
Structural Information & Communication Complexity: 21st International Colloquium, SIROCCO 2014, Takayama, Japan, July 23-25, 2014. Proceedings; 2014, p355-370, 16p