Lattice agreement in message passing systems

DOI10.4230/LIPICS.DISC.2018.41MaRDI QIDQ5090934zbMATH OpenFDO

Authors

Publication date 21 July 2022

Full work available at URL https://arxiv.org/abs/1807.11557

zbMATH Keywords

consensuslattice agreementreplicated state machine

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14) Lattices (06B99)

Recommendations

• Generalized lattice agreement
• Split and migrate: Resource-driven placement and discovery of microservices at the edge
• Atomic snapshots using lattice agreement
• Bounds on the time to reach agreement in the presence of timing uncertainty
• Lower bounds for asynchronous consensus

Cites work

• scientific article; zbMATH DE number 1179121 (Why is no real title available?)
• Atomic Snapshots in O (n log n) Operations
• Atomic snapshots of shared memory
• Atomic snapshots using lattice agreement
• Authenticated Algorithms for Byzantine Agreement
• Concurrent programming: algorithms, principles, and foundations.
• Convergent and commutative replicated data types
• Distributed systems. Principles and paradigms.
• Generalized lattice agreement
• Impossibility of distributed consensus with one faulty process
• The part-time parliament
• Waiting in concurrent algorithms

Cited in

(6)

• Asynchronous reconfiguration with Byzantine failures
• Byzantine lattice agreement in synchronous message passing systems
• Split and migrate: Resource-driven placement and discovery of microservices at the edge
• Generalized lattice agreement
• On a scenario of transition to turbulence for polymer fluid flow in a circular pipe;Об одном сценарии перехода к турбулентности при течении полимерной жидкости в цилиндрическом канале
• Store-collect in the presence of continuous churn with application to snapshots and lattice agreement

This page was built for publication: Lattice agreement in message passing systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090934)