Pages that link to "Item:Q1954212"
From MaRDI portal
The following pages link to The overhead of consensus failure recovery (Q1954212):
Displaying 6 items.
- Using asynchrony and zero degradation to speed up indulgent consensus protocols (Q436832) (← links)
- An optimality proof for asynchronous recovery algorithms in distributed systems (Q672018) (← links)
- Generating fast indulgent algorithms (Q693079) (← links)
- On the minimum requirements for independent recovery in distributed systems (Q922672) (← links)
- A Paxos based algorithm to minimize the overhead of process recovery in consensus (Q2422778) (← links)
- How to Solve Consensus in the Smallest Window of Synchrony (Q3540219) (← links)