Tree Topologies for Causal Message Delivery
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 OctDisplayed time zone: Tijuana, Baja California change
10:30 - 12:00
Session 1: Verification and Language ModelsAGERE at Prince of Wales
Chair(s): Joeri De Koster Vrije Universiteit Brussel, Belgium
|Sparrow - A DSL for Coordinating Large Groups of Heterogeneous Actors|
Humberto Rodriguez Avila Vrije Universiteit Brussel, Joeri De Koster Vrije Universiteit Brussel, Belgium, Wolfgang De Meuter Vrije Universiteit BrusselFile Attached
|Tree Topologies for Causal Message Delivery|
Sebastian Blessing Imperial College London, Sylvan Clebsch Imperial College London, Sophia Drossopoulou
|Order Types: Static Reasoning about Message Races in Asynchronous Message Passing Concurrency|
Mehdi Bagherzadeh Oakland University, Hridesh Rajan Iowa State UniversityFile Attached