DOI

Developers often combine different concurrency models in a single program, in each part of the program using the model that fits best. Many programming languages, such as Clojure, Scala, and Haskell, cater to this need by supporting different concurrency models. However, they are often combined in an ad hoc way and the semantics of the combination is not always well defined.

This paper studies the combination of three concurrency models: futures, actors, and transactions. We show that a naive combination of these models invalidates the guarantees they normally provide, thereby breaking the assumptions of developers. Hence, we present Chocola: a unified framework of futures, actors, and transactions that maintains the guarantees of all models wherever possible, even when they are combined. We present the semantics of this model and its implementation in Clojure, and have evaluated its performance and expressivity using three benchmark applications.
Original languageEnglish
Title of host publicationProceedings of the 8th ACM SIGPLAN International Workshop on Programming Based on Actors, Agents, and Decentralized Control (AGERE '18)
PublisherACM
ISBN (Electronic)978-1-4503-6066-1/18/11
DOIs
Publication statusAccepted/In press - 5 Nov 2018
Event8th ACM SIGPLAN International Workshop on Programming Based on Actors, Agents, and Decentralized Control - Boston, United States
Duration: 5 Nov 20185 Nov 2018

Workshop

Workshop8th ACM SIGPLAN International Workshop on Programming Based on Actors, Agents, and Decentralized Control
Abbreviated titleAGERE'18
CountryUnited States
CityBoston
Period5/11/185/11/18

    Research areas

  • concurrency, parallelism, futures, actors, transactions, Software Transactional Memory

ID: 39829436