Partial synchrony based on set timeliness

DOI10.1145/1582716.1582737zbMath1291.68060OpenAlexW1967487759MaRDI QIDQ5170307

Hugues Fauconnier, Carole Delporte-Gallet, Sam Toueg, Marcos Kawazoe Aguilera

Publication date: 23 July 2014

Published in: Proceedings of the 28th ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1582716.1582737

zbMATH Keywords

algorithmsconsensusset agreementimpossibilitypartial synchronyfailure detectorstimelinessbivalency

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (1)

Partial synchrony based on set timeliness

This page was built for publication: Partial synchrony based on set timeliness