dorsal/arxiv
View SchemaMultiverse: Transactional Memory with Dynamic Multiversioning
| Authors | Gaetano Coccimiglio, Trevor Brown, Srivatsan Ravi |
|---|---|
| Categories | |
| ArXiv ID | 2601.09735vv1 |
| URL | https://arxiv.org/abs/2601.09735 |
| License | http://creativecommons.org/licenses/by/4.0/ |
Abstract
Software transactional memory (STM) allows programmers to easily implement concurrent data structures. STMs simplify atomicity. Recent STMs can achieve good performance for some workloads but they have some limitations. In particular, STMs typically cannot support long-running reads which access a large number of addresses that are frequently updated. Multiversioning is a common approach used to support this type of workload. However, multiversioning is often expensive and can reduce the performance of transactions where versioning is not necessary. In this work we present Multiverse, a new STM that combines the best of both unversioned TM and multiversioning. Multiverse features versioned and unversioned transactions which can execute concurrently. A main goal of Multiverse is to ensure that unversioned transactions achieve performance comparable to the state of the art unversioned STM while still supporting fast versioned transactions needed to enable long running reads. We implement Multiverse and compare it against several STMs. Our experiments demonstrate that Multiverse achieves comparable or better performance for common case workloads where there are no long running reads. For workloads with long running reads and frequent updates Multiverse significantly outperforms existing STMS. In several cases for these workloads the throughput of Multiverse is several orders of magnitude faster than other STMs.
{
"annotation_id": "4f92f9c1-871a-42de-b2f8-dc14b7ec84a6",
"date_created": "2026-02-17T05:53:24.052000Z",
"date_modified": "2026-02-17T05:53:24.052000Z",
"file_hash": "48da95d3ae11eb8c6e995737abb5ac14c01d1229e52778f19cb906f6ce8e57e4",
"private": false,
"record": {
"abstract": "Software transactional memory (STM) allows programmers to easily implement concurrent data structures. STMs simplify atomicity. Recent STMs can achieve good performance for some workloads but they have some limitations. In particular, STMs typically cannot support long-running reads which access a large number of addresses that are frequently updated. Multiversioning is a common approach used to support this type of workload. However, multiversioning is often expensive and can reduce the performance of transactions where versioning is not necessary. In this work we present Multiverse, a new STM that combines the best of both unversioned TM and multiversioning. Multiverse features versioned and unversioned transactions which can execute concurrently. A main goal of Multiverse is to ensure that unversioned transactions achieve performance comparable to the state of the art unversioned STM while still supporting fast versioned transactions needed to enable long running reads. We implement Multiverse and compare it against several STMs. Our experiments demonstrate that Multiverse achieves comparable or better performance for common case workloads where there are no long running reads. For workloads with long running reads and frequent updates Multiverse significantly outperforms existing STMS. In several cases for these workloads the throughput of Multiverse is several orders of magnitude faster than other STMs.",
"arxiv_id": "2601.09735",
"authors": [
"Gaetano Coccimiglio",
"Trevor Brown",
"Srivatsan Ravi"
],
"categories": [
"cs.DB"
],
"license": "http://creativecommons.org/licenses/by/4.0/",
"title": "Multiverse: Transactional Memory with Dynamic Multiversioning",
"url": "https://arxiv.org/abs/2601.09735",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "e3e1e6d3-a6df-40d4-893e-d05dc07f535b",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}