LIPIcs.OPODIS.2024.1.pdf
- Filesize: 319 kB
- 1 pages
Document
The Power of Simplicity on Dependable Distributed Systems (Invited Talk)
Author
Alysson Bessani 
-
Part of:
Volume:
28th International Conference on Principles of Distributed Systems (OPODIS 2024)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Conference on Principles of Distributed Systems (OPODIS) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2025-01-08
File
Document Identifiers
Author Details
Cite As Get BibTex
Alysson Bessani. The Power of Simplicity on Dependable Distributed Systems (Invited Talk). In 28th International Conference on Principles of Distributed Systems (OPODIS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 324, p. 1:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.OPODIS.2024.1
Abstract
Contrary to a (somewhat) common belief, the most important property of a practical distributed algorithm is not its efficiency or performance but its simplicity. This fact is even more evident when considering dependable distributed systems. In this talk, I will present some cases in which simple protocols and elegant abstractions - which were not the most efficient for the problem at hand - enabled the deployment of dependable solutions that changed the practice of distributed computing. I will also discuss how the quest for simplicity influenced my work on BFT and multi-cloud storage. Ultimately, I aim to convince the audience that "simplicity is the ultimate sophistication" in distributed computing.
Subject Classification
ACM Subject Classification
- Computing methodologies → Distributed algorithms
- Computer systems organization → Dependable and fault-tolerant systems and networks
Keywords
- Abstractions
- Simplicity
- Byzantine Fault Tolerance
- Cloud Storage
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads