OPODIS 2021 13, 14, 15, December 2021

Important dates
Abstract: September 3, 2021 (extended)
Full paper: September 8, 2021 (extended)
Notification: October 29, 2021
Camera ready: November 19, 2021
Conference: 13, 14, 15, December 2021
Last Info

The Best Student Paper Award was given to Gabriel Le Bouder for his paper titled "Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms", co-authored with Laurent Feuilloley and Lélia Blin. The Best Paper Award was awarded to Ittai Abraham, Kartik Nayak and Nibesh Shrestha for their paper titled "Optimal Good-case Latency for Rotating Leader Synchronous BFT" The videos are available on the PODC-DISC Youtube channel: playlist


OPODIS is an open forum for the exchange of state-of-the-art knowledge concerning distributed computing and distributed computer systems. All aspects of distributed systems are within the scope of OPODIS, including theory, specification, design, performance, and system building. With strong roots in the theory of distributed systems, OPODIS now covers the whole range between the theoretical aspects and practical implementations of distributed systems, as well as experimentation and quantitative assessments.


General Chair
Quentin Bramas, University of Strasbourg, France
Program Chairs
Vincent Gramoli, University of Sydney, Australia, and EPFL
Alessia Milani, LIS, Aix-Marseille Université, France
Steering Comitee
Xavier Défago, Tokyo Institute of Technology, Japan
Panagiota Fatourou, University of Crete, Greece
Pascal Felber, University of Neuchâtel, Switzerland — chair
Paola Flocchini, University of Ottawa, Canada
Roy Friedman, Technion - Israel Institute of Technology, Israel
Seth Gilbert, National University of Singapore
Rotem Oshman, Tel Aviv University, Israel
Paolo Romano, Lisbon University/INESC-ID, Portugal
Program Comitee
Emmanuelle Anceaume, CNRS / IRISA
Hagit Attiya, Technion
Alkida Balliu, University of Freiburg
Alysson Bessani, LASIGE, FCUL, Universidade de Lisboa
Borzoo Bonakdarpour, Michigan State University
Janna Burman, Université Paris-Saclay, CNRS
Armando Castaneda, UNAM
Giuseppe Antonio Di Luna, Sapienza, Università di Roma
Alexey Gotsman, IMDEA Software Institute
Vincent Gramoli, The University of Sydney and EPFL — chair
Eschar Hillel, Yahoo
Colette Johnen, University of Bordeaux- LaBRI
Sayaka Kamei, Hiroshima University
Alex Kogan, Oracle Labs
Dariusz Kowalski, University of Liverpool
Kostas Magoutis, University of Crete and FORTH-ICS
Avery Miller, University of Manitoba
Alessia Milani, LIS, Aix-Marseille Université, France — chair
Marina Papatriantafilou, Chalmers University
Ami Paz, University of Vienna
Yvonne-Anne Pignolet, DFINITY Foundation
Etienne Rivière, Université catholique de Louvain
Luis Rodrigues, Universidade de Lisboa
Jared Saia, University of New Mexico
Stefan Schmid, University of Vienna
Gokarna Sharma, Kent State University
Michael Spear, Lehigh University
Jukka Suomela, Aalto University
Nitin Vaidya, Georgetown University
Gauthier Voron, EPFL

Keynote Speakers

Picture of Petr Kuznetsov;  INFRES, Telecom Paris, Institut Polytechnique de Paris
Petr Kuznetsov, INFRES, Telecom Paris, Institut Polytechnique de Paris
Title: Accountable distributed computing
Abstract: There are two major ways to deal with failures in distributed computing: fault-tolerance and accountability. Fault-tolerance intends to anticipate failures by investing into replication and synchronization, so that the system’s correctness is not affected by faulty components. In contrast, accountability enables detecting failures a posteriori and raising undeniable evidences against faulty components. In this talk, we discuss how accountability can be achieved, both in generic and application-specific ways. We also discuss how fault detection can be combined with reconfiguration, opening an avenue towards "self-healing" systems that seamlessly replace faulty components with correct ones.
Picture of Nathalie Bertrand; INRIA, Rennes
Nathalie Bertrand, INRIA, Rennes
Title: Distributed algorithms: a challenging playground for model checking
Abstract: Distributed computing is increasingly spreading, in advanced technological applications as well as in our daily life. Failures in distributed algorithms can have important human and financial consequences, so that is is crucial to develop rigorous techniques to verify their correctness. Model checking is a model-based approach to formal verification, dating back the 80's. It has been successfully applied first to hardware, and later to software verification. Distributed computing raises new challenges for the model checking community, and calls for the development of new verification techniques and tools. In particular, the parameterized verification paradigm is nowadays blooming to help proving automatically the correctness of distributed algorithms.
Picture of Robbert van Renesse; Cornell University, Ithaca, NY, USA
Robbert van Renesse, Cornell University, Ithaca, NY, USA
Title: A fresh look at the design and implementation of communication paradigms
Abstract: Datacenter applications consist of many communicating components and evolve organically as requirements develop over time. In this talk I will present two projects that try to support such organic growth. The first project, Escher, recognizes that components of a distributed systems may themselves be distributed systems. Escher introduces a communication abstraction that hides the internals of a distributed component, and in particular how to communicate with it, from other components. Using Escher, a replicated server can invoke another replicated server without either server having to even know that the servers are replicated. The second project, Scalog, presents a datacenter scale totally ordered logging service. Logs are increasingly a central component in many datacenter applications, but log configurations can lead to significant hiccups in the performance of those applications. Scalog has seamless reconfiguration operations that allow it to scale up and down without any downtime.


See fullscreen