scientific article; zbMATH DE number 7561447
From MaRDI portal
Publication:5091093
DOI10.4230/LIPIcs.OPODIS.2018.19MaRDI QIDQ5091093
Yvonne Anne Pignolet, Ognjen Marić, David Kozhaya
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1811.05007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)
Cites Work
- Unnamed Item
- Unnamed Item
- Combining shared-coin algorithms
- Safe termination detection in an asynchronous distributed system when processes may crash and recover
- Decomposition of distributed programs into communication-closed layers
- Defining liveness
- In search of lost time
- Randomized distributed decision
- Round-by-round fault detectors (extended abstract)
- How to Solve Consensus in the Smallest Window of Synchrony
- Impossibility Results and Lower Bounds for Consensus under Link Failures
- Randomization Can Be a Healer: Consensus with Dynamic Omission Failures
- Asynchronous consensus and broadcast protocols
- Impossibility of distributed consensus with one faulty process
- Reaching Agreement in the Presence of Faults
- Unreliable failure detectors for reliable distributed systems
- The part-time parliament
- Early consensus in an asynchronous system with a weak failure detector
This page was built for publication:
