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.
@InProceedings{bessani:LIPIcs.OPODIS.2024.1, author = {Bessani, Alysson}, title = {{The Power of Simplicity on Dependable Distributed Systems}}, booktitle = {28th International Conference on Principles of Distributed Systems (OPODIS 2024)}, pages = {1:1--1:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-360-7}, ISSN = {1868-8969}, year = {2025}, volume = {324}, editor = {Bonomi, Silvia and Galletta, Letterio and Rivi\`{e}re, Etienne and Schiavoni, Valerio}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2024.1}, URN = {urn:nbn:de:0030-drops-225372}, doi = {10.4230/LIPIcs.OPODIS.2024.1}, annote = {Keywords: Abstractions, Simplicity, Byzantine Fault Tolerance, Cloud Storage} }
Feedback for Dagstuhl Publishing