Write a Blog >>
Sun 22 - Fri 27 October 2017 Vancouver, Canada

Causal message delivery, i.e. the requirement that messages are delivered in an order respecting their causal (logical) dependencies, is often mandated in the distributed setting. So far, causal message delivery was implemented by augmenting messages with metadata information that allows the receiver (or the platform) to re-order, and if necessary hold back, messages upon receipt before processing.

We propose that causal message delivery can be achieved by construction, simply by organizing the nodes of the distributed application into a tree topology, and without the need for any metadata in the messages.

We present our ideas informally through an example application and then develop and present a formal model to prove that causal message delivery is preserved in tree-based networks.

Mon 23 Oct
Times are displayed in time zone: Tijuana, Baja California change

10:30 - 12:00: Session 1: Verification and Language ModelsAGERE at Prince of Wales
Chair(s): Joeri De KosterVrije Universiteit Brussel, Belgium
10:30 - 11:00
Sparrow - A DSL for Coordinating Large Groups of Heterogeneous Actors
Humberto Rodriguez AvilaVrije Universiteit Brussel, Joeri De KosterVrije Universiteit Brussel, Belgium, Wolfgang De MeuterVrije Universiteit Brussel
File Attached
11:00 - 11:30
Tree Topologies for Causal Message Delivery
Sebastian BlessingImperial College London, Sylvan ClebschImperial College London, Sophia Drossopoulou
11:30 - 12:00
Order Types: Static Reasoning about Message Races in Asynchronous Message Passing Concurrency
Mehdi BagherzadehOakland University, Hridesh RajanIowa State University
File Attached