[图书][B] Introduction to reliable and secure distributed programming
In modern computing a program is usually distributed among several processes. The
fundamental challenge when developing reliable and secure distributed programs is to …
fundamental challenge when developing reliable and secure distributed programs is to …
[图书][B] Introduction to reliable distributed programming
R Guerraoui, L Rodrigues - 2006 - books.google.com
In modern computing a program is usually distributed among several processes. The
fundamental challenge when developing reliable distributed programs is to support the …
fundamental challenge when developing reliable distributed programs is to support the …
[PDF][PDF] The complexity of facets resolved
CH Papadimitriou, D Wolfe - 1985 - ecommons.cornell.edu
The polytopal approach of Edmonds and Fulkerson has been used with great success in the
development of polynomial algorithms for a number of combinatorial optimization problems …
development of polynomial algorithms for a number of combinatorial optimization problems …
ubft: Microsecond-scale bft using disaggregated memory
We propose uBFT, the first State Machine Replication (SMR) system to achieve microsecond-
scale latency in data centers, while using only 2 f+ 1 replicas to tolerate f Byzantine failures …
scale latency in data centers, while using only 2 f+ 1 replicas to tolerate f Byzantine failures …
The missing piece: a distributed system-level diagnosis model for the implementation of unreliable failure detectors
Reliable systems require effective monitoring techniques for fault identification. System-level
diagnosis was originally proposed in the 1960s as a test-based approach to monitor and …
diagnosis was originally proposed in the 1960s as a test-based approach to monitor and …
Dynamic atomic storage without consensus
This article deals with the emulation of atomic read/write (R/W) storage in dynamic
asynchronous message passing systems. In static settings, it is well known that atomic R/W …
asynchronous message passing systems. In static settings, it is well known that atomic R/W …
[图书][B] Communication and agreement abstractions for fault-tolerant asynchronous distributed systems
M Raynal - 2022 - books.google.com
Understanding distributed computing is not an easy task. This is due to the many facets of
uncertainty one has to cope with and master in order to produce correct distributed software …
uncertainty one has to cope with and master in order to produce correct distributed software …
Quorum subsumption for heterogeneous quorum systems
X Li, E Chan, M Lesani - arXiv preprint arXiv:2304.04979, 2023 - arxiv.org
Byzantine quorum systems provide higher throughput than proof-of-work and incur modest
energy consumption. Further, their modern incarnations incorporate personalized and …
energy consumption. Further, their modern incarnations incorporate personalized and …
[HTML][HTML] Gracefully degrading consensus and k-set agreement in directed dynamic networks
We study distributed agreement in synchronous directed dynamic networks, where an
omniscient message adversary controls the presence/absence of communication links. We …
omniscient message adversary controls the presence/absence of communication links. We …