2026-08-08T04:31:21Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:13081 2024-03-06T10:51:31Z ddc:004 open_access

The Splay-List: A Distribution-Adaptive Concurrent Skip-List Aksenov, Vitaly Alistarh, Dan Drozdova, Alexandra Mohtashami, Amirkeivan Data structures self-adjusting concurrency The design and implementation of efficient concurrent data structures has seen significant attention. However, most of this work has focused on concurrent data structures providing good worst-case guarantees. In real workloads, objects are often accessed at different rates, since access distributions may be non-uniform. Efficient distribution-adaptive data structures are known in the sequential case, e.g. the splay-trees; however, they often are hard to translate efficiently in the concurrent case. In this paper, we investigate distribution-adaptive concurrent data structures, and propose a new design called the splay-list. At a high level, the splay-list is similar to a standard skip-list, with the key distinction that the height of each element adapts dynamically to its access rate: popular elements "move up," whereas rarely-accessed elements decrease in height. We show that the splay-list provides order-optimal amortized complexity bounds for a subset of operations, while being amenable to efficient concurrent implementation. Experimental results show that the splay-list can leverage distribution-adaptivity to improve on the performance of classic concurrent designs, and can outperform the only previously-known distribution-adaptive design in certain settings. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Vitaly Aksenov and Dan Alistarh and Alexandra Drozdova and Amirkeivan Mohtashami 2020 Is Part Of LIPIcs, Volume 179, 34th International Symposium on Distributed Computing (DISC 2020) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.DISC.2020.3 urn:nbn:de:0030-drops-130818 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.3 eng https://creativecommons.org/licenses/by/3.0/legalcode