Schedule

Monday, June 16

08:55 – 18:00 Workshop: Advanced Tools, Programming Languages, and PLatforms for Implementing and Evaluating algorithms for Distributed systems (ApPLIED)
Room: Cacaluta-Arenal
10:00 – Tutorial: Machine-Verifying Concurrent Algorithms by Siddhartha Jayanti
Room: Tangolunda
10:00 – 12:00
14:30 – 16:30		 DC Mexico Summer School
Room: Conejo
12:25 – 13:50 Lunch break at Restaurante Solarium
18:00 – 21:00 Welcome cocktail at Salón Maguey

Tuesday, June 17

PODC Room: Coyote
09:00 – 09:05 Opening remarks
09:05 – 10:10 Keynote: Disaggregated Memory and the Revival of Memory Research by Marcos Aguilera
10:10 – 10:40 Coffee break
10:40 – 12:25 Session 1 (chair: Gregory Chockler)
12:25 – 13:50 Lunch break at Restaurante Solarium
13:50 – 15:35 Session 2 (chair: Dennis Olivetti)
15:35 – 16:05 Coffee break
16:05 – 17:45 Session 3 (chair: Alessia Milani)
18:00 – 19:30 Business Meeting

Wednesday, June 18

PODC Room: Coyote
09:00 – 10:10Session 4 (chair: Wojciech Golab)
Best Paper Award Session
10:10 – 10:40Coffee Break
10:40 – 12:25Session 5 (chair: Yoram Moses)
12:25 – 13:50Lunch Break at Restaurante Solarium
13:50 – 15:35Session 6 (chair: Rotem Oshman)
15:35 – 16:05Coffee Break
16:05 – 17:45Session 7 (chair: Seth Gilbert)
19:00 – 21:00Banquet at Salón Maguey
10:00 – 12:00
14:30 – 16:30		 DC Mexico Summer School
Room: Conejo

Thursday, June 19

PODC Room: Coyote
09:00 – 10:10 Keynote: Examples of Mantras as a Beacon in Guiding Research by Eli Gafni
10:10 – 10:40 Coffee Break
10:40 – 12:25 Session 8 (chair: Christoph Grunau)
12:25 – 13:50 Lunch Break at Restaurante Solarium
13:50 – 15:35 Session 9 (chair: Philipp Woelfel)
15:35 – 16:05 Coffee Break
16:05 – 17:45 Session 10 (chair: Andrea Richa)
17:45 – 18:00 Closing Remarks

Friday, June 20

09:00 – 15:00 Tutorial: Information Theory and Applications by Rotem Oshman
Room: Cacaluta-Arenal
12:25 – 13:50 Lunch break at Restaurante Solarium
10:00 – 12:00
14:30 – 16:30		DC Mexico Summer School
Room: Conejo

Keynotes

Disaggregated Memory and the Revival of Memory Research

by Marcos K. Aguilera (VMware Research by Broadcom)

Emerging hardware technologies bring exciting new capabilities and challenges to our research menu. One such technology is disaggregated memory. While its roots date back to the early 1990s, it is only now that this technology is getting rolled out. Disaggregated memory allows servers in a data center to share a memory that is externally connected. This form of sharing differs conceptually from traditional shared memory in many ways: performance, fault model, coherence, and the ability to communicate with other mechanisms. These differences open up new applications and research questions on how to best use this memory effectively. In this talk, we explore some recent and ongoing work in this area.

Examples of Mantras as a Beacon in Guiding Research

by Eli Gafni (University of California Los Angeles, eli@cs.ucla.edu)

Not knowing if something can be done and doing it = research.
Doing something knowing it has been done = solving a puzzle.
Deep belief in a mantra that implies that something can be done = transforms doing research into solving puzzles.

Over the years, my research has been guided by a deep belief in certain mantras. To name two:

  1. The integer 1 is not special in DC – hence “generalized universality.”
  2. There is no “proliferation of models” in distributed computing (DC) – hence “message adversary.”

My mantras are based on my belief that deterministic DC when formulated cleanly is a branch of mathematics that studies interleaving, and like Mathematics should be structured and elegant.

I will show some mantras in action, by first discussing Shared Memory (SM) as a task and message adversary. I will show that the properties of SM constitute a lattice with a single path at the bottom, and transitive closure (immediate snapshot) at the top. I will then show that the mantra of “asynchrony = synchrony with mobile failures,” removes the anomaly that eventually synchronous Byzantine agreement with signatures requires less than a third faults. The anomaly vanishes if signatures are replaced by the appropriate constraints on a Byzantine message adversary.

Sessions

Session 1 (June 17, 10:40 – 12:25)

Chair: Gregory Chockler

Session 2 (June 17, 13:50 – 15:35)

Chair: Dennis Olivetti

Session 3 (June 17, 16:05 – 17:45)

Chair: Alessia Milani

Session 4 (June 18, 09:00 – 10:10)

Chair: Wojciech Golab

Session 5 (June 18, 10:40 – 12:25)

Chair: Yoram Moses

Session 6 (June 18, 13:50 – 15:35)

Chair: Rotem Oshman

Session 7 (June 18, 16:05 – 17:45)

Chair: Seth Gilbert

Session 8 (June 19, 10:40 – 12:25)

Chair: Christoph Grunau

Session 9 (June 19, 13:50 – 15:35)

Chair: Philipp Woelfel

Session 10 (June 19, 16:05 – 17:45)

Chair: Andrea Richa