A Paxos based algorithm to minimize the overhead of process recovery in consensus

DOI10.1007/s00236-019-00334-wzbMath1429.68331OpenAlexW2940902485WikidataQ127962065 ScholiaQ127962065MaRDI QIDQ2422778

Ramesh Kandukoori, Sathyanarayanan Srinivasan

Publication date: 20 June 2019

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-019-00334-w

zbMATH Keywords

distributed systemsasynchronous communicationsconsensus algorithm

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• The overhead of consensus failure recovery
• How to Solve Consensus in the Smallest Window of Synchrony
• Impossibility of distributed consensus with one faulty process
• On the minimal synchronism needed for distributed consensus
• Reaching Agreement in the Presence of Faults
• The weakest failure detector for solving consensus

This page was built for publication: A Paxos based algorithm to minimize the overhead of process recovery in consensus