2026-07-31T11:45:36Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6117 2024-03-06T10:38:01Z ddc:004 open_access

Transactional Tasks: Parallelism in Software Transactions Swalens, Janwillem De Koster, Joeri De Meuter, Wolfgang Concurrency Parallelism Futures Threads Fork/Join Software Transactional Memory Many programming languages, such as Clojure, Scala, and Haskell, support different concurrency models. In practice these models are often combined, however the semantics of the combinations are not always well-defined. In this paper, we study the combination of futures and Software Transactional Memory. Currently, futures created within a transaction cannot access the transactional state safely, violating the serializability of the transactions and leading to undesired behavior. We define transactional tasks: a construct that allows futures to be created in transactions. Transactional tasks allow the parallelism in a transaction to be exploited, while providing safe access to the state of their encapsulating transaction. We show that transactional tasks have several useful properties: they are coordinated, they maintain serializability, and they do not introduce non-determinism. As such, transactional tasks combine futures and Software Transactional Memory, allowing the potential parallelism of a program to be fully exploited, while preserving the properties of the separate models where possible. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Janwillem Swalens and Joeri De Koster and Wolfgang De Meuter 2016 Is Part Of LIPIcs, Volume 56, 30th European Conference on Object-Oriented Programming (ECOOP 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ECOOP.2016.23 urn:nbn:de:0030-drops-61173 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2016.23 eng https://creativecommons.org/licenses/by/3.0/legalcode