Program

PaPoC 2021 will take place on April 26th 2021. All times are given in British Summer Time (BST). The proceedings are available in the ACM Digital Library and the talks are available on YouTube.

Opening & Session 1: 1:30 PM - 2:30 PM

• Certified Mergeable Replicated Data Types. Vimala Soundarapandian (Indian Institute of Technology, Madras, India), KC Sivaramakrishnan (Indian Institute of Technology, Madras, India) and Kartik Nagar (Indian Institute of Technology, Madras, India). [talk]
• Array CRDTs Using Delta-Mutations. Arik Rinberg (Technion, Israel), Tomer Solomon (IBM, Israel), Gal Lushi (IBM, Israel), Roee Shlomo (IBM, Israel), Guy Khazma (IBM, Israel) and Paula Ta-Shma (IBM, Israel). [paper,talk]
• Access Control Conflict Resolution in Distributed File Systems using CRDTs. Elena Yanakieva (TU Kaiserslautern, Germany), Michael Youssef (TU Kaiserslautern, Germany), Ahmad Hussein Rezae (TU Kaiserslautern, Germany) and Annette Bieniusa (TU Kaiserslautern, Germany). [paper,talk,slides]
• Improving the Reactivity of Pure Operation-Based CRDTs. Jim Bauwens (Vrije Universiteit Brussel, Belgium) and Elisa Gonzalez Boix (Vrije Universiteit Brussel, Belgium). [paper,talk]

Session 2: 2:30 PM - 3:30 PM

• Towards the Synthesis of Coherence/Replication Protocols from Consistency Models via Real-Time Orderings. Vasilis Gavrielatos (University of Edinburgh, United Kingdom), Vijay Nagarajan (University of Edinburgh, United Kingdom) and Panagiota Fatourou (University of Crete, Greece). [paper,talk,slides]
• Totally-Ordered Prefix Parallel Snapshot Isolation. Nuno Faria (INESCTEC & University of Minho, Portugal) and José Pereira (INESCTEC & University of Minho, Portugal). [paper,talk,slides]
• Advanced Domain-Driven Design for Consistency in Distributed Data-Intensive Systems. Susanne Braun (Fraunhofer, Germany), Annette Bieniusa (TU Kaiserslautern , Germany) and Frank Elberzhager (Fraunhofer, Germany). [paper,talk]
• SCEW: Programmable BFT-Consensus with Smart Contracts for Client-Centric P2P Web Applications. Martijn Sauwens (imec-DistriNet, KU Leuven, Belgium), Kristof Jannes (imec-DistriNet, KU Leuven, Belgium), Bert Lagaisse (imec-DistriNet, KU Leuven, Belgium) and Wouter Joosen (imec-DistriNet, KU Leuven, Belgium). [paper,talk,slides]

Session 3: 3:30 PM - 4:30 PM

• Convergent Causal Consistency for Social Media Posts. Tayuan Hsu (University of Illinois at Chicago, United States) and Ajay Kshemkalyani (University of Illinois at Chicago, United States). [paper,talk]
• Cambria: Schema Evolution in Distributed Systems with Edit Lenses. Geoffrey Litt (Massachusetts Institute of Technology, United States), Peter van Hardenberg (Ink and Switch, United States) and Orion Henry (Ink and Switch, United States). [paper,talk]
• Read-Write Quorum Systems Made Practical. Michael Whittaker (UC Berkeley, United States), Aleksey Charapko (University of New Hampshire, United States), Joseph Hellerstein (UC Berkeley, United States), Heidi Howard (University of Cambridge, United Kingdom) and Ion Stoica (UC Berkeley, United States). [paper,talk,slides]

Lightning Talks: 4:30 PM - 5:00 PM

• Benjamin Bengfort - Scaling Consensus with Delegation
• Rebecca Bilbro - An API for Consensus
• Kane Boubacar - Degradability
• Joran Dirk Greef - Viewstamped Replication Made Famous [slides]
• Martin Kleppmann - Metadata compression in the Automerge CRDT library
• Jonathan Nadal - Building Distributed Systems With Stateright

Keynote: 5:00 PM - 6:00 PM

This is a joint keynote by Peter Alvaro with LADIS.

What not where: Sharing in a world of distributed, persistent memory

Abstract:

A world of distributed, persistent memory is on its way. Our programming models traditionally operate on short-lived data representations tied to ephemeral contexts such as processes or computers. In the limit, however, data lifetime is infinite compared to these transient actors. We discuss the implications for programming models raised by a world of large and potentially persistent distributed memories, including the need for explicit, context-free, invariant data references. We present a novel operating system that uses wisdom from both storage and distributed systems to center the programming model around data as the primary citizen, and reflect on the transformative potential of this change for infrastructure and applications of the future. We focus in particular on the landscape of data sharing and the consequences of globally-addressable persistent memory on existing consistency models and mechanisms.

Bio:

Peter Alvaro is an Assistant Professor of Computer Science at the University of California Santa Cruz, where he leads the Disorderly Labs research group (disorderlylabs.github.io). His research focuses on using data-centric languages and analysis techniques to build and reason about data-intensive distributed systems, in order to make them scalable, predictable and robust to the failures and nondeterminism endemic to large-scale distribution. Peter earned his PhD at UC Berkeley, where he studied with Joseph M. Hellerstein. He is a recipient of the NSF CAREER Award, the Facebook Research Award, the USENIX ATC Best Presentation Award, and the UCSC Excellence in Teaching Award.