Wed 24 Mar 2021 15:00 - 15:30 at Virtual Space B - Session 4 Chair(s): Ademar Aguiar
Thu 25 Mar 2021 16:00 - 16:30 at Virtual Space A - Session 9 Chair(s): Ademar Aguiar

Context

Concurrent objects with asynchronous messaging are an increasingly popular way to structure highly available, high performance, large-scale software systems. To ensure data-consistency and support synchronization between objects such systems often use distributed transactions with Two-Phase Locking (2PL) for concurrency control and Two-Phase commit (2PC) as atomic commitment protocol. Inquiry In highly available, high-throughput systems, such as large banking infrastructure, however, 2PL becomes a bottleneck when objects are highly contended, when an object is queuing a lot of messages because of locking.

Approach

In this paper we introduce Path-Sensitive Atomic Commit (PSAC) to address this situation. We start from message handlers (or methods), which are decorated with pre- and post-conditions, describing their guards and effect.

Knowledge

This allows the PSAC lock mechanism to check whether the effect of two incoming messages at the same time are independent, and to avoid locking if this is the case. As a result, more messages are directly accepted or rejected, and higher overall throughput is obtained.

Grounding

We have implemented PSAC for a state machine-based DSL called Rebel, on top of a runtime based on the Akka actor framework. Our performance evaluation shows that PSAC exhibits the same scalability and latency characteristics as standard 2PL/2PC, and obtains up to 1.8 times median higher throughput in congested scenarios.

Importance

We believe PSAC is a step towards enabling organizations to build scalable distributed applications, even if their consistency requirements are not embarrassingly parallel.

Conference Day
Wed 24 Mar

Displayed time zone: Belfast change

15:00 - 16:30
Session 4Research Papers at Virtual Space B
Chair(s): Ademar AguiarFEUP, Universidade do Porto
15:00
30m
Live Q&A
Path-Sensitive Atomic Commit: Local Coordination Avoidance for Distributed Transactions
Research Papers
Tim SoethoutING Bank and Centrum Wiskunde & Informatica (CWI), Tijs van der StormCWI & University of Groningen, Netherlands, Jurgen VinjuCWI, Netherlands
DOI Media Attached
15:30
30m
Live Q&A
Interactive Music and Synchronous Reactive Programming
Research Papers
Bertrand PetitINRIA, France, Manuel SerranoInria, France
DOI Media Attached
16:00
30m
Live Q&A
Programming Paradigms, Turing Completeness and Computational Thinking
Research Papers
Greg MichaelsonHeriot-Watt University
DOI Media Attached

Conference Day
Thu 25 Mar

Displayed time zone: Belfast change

15:00 - 16:30
Session 9Research Papers at Virtual Space A
Chair(s): Ademar AguiarFEUP, Universidade do Porto
15:00
30m
Live Q&A
Bacatá: Notebooks for DSLs, Almost for Free
Research Papers
Mauricio Verano MerinoTechnische Universiteit Eindhoven, Jurgen VinjuCWI, Netherlands, Tijs van der StormCWI & University of Groningen, Netherlands
DOI Media Attached
15:30
30m
Live Q&A
Prioritising Server Side Reachability via Inter-process Concolic Testing
Research Papers
Maarten VandercammenVrije Universiteit Brussel, Laurent ChristopheVUB, Dario Di NucciTilburg University, Wolfgang De MeuterVrije Universiteit Brussel, Coen De RooverVrije Universiteit Brussel
Link to publication DOI Media Attached
16:00
30m
Live Q&A
Path-Sensitive Atomic Commit: Local Coordination Avoidance for Distributed Transactions
Research Papers
Tim SoethoutING Bank and Centrum Wiskunde & Informatica (CWI), Tijs van der StormCWI & University of Groningen, Netherlands, Jurgen VinjuCWI, Netherlands
DOI Media Attached