[{"month":"09","publication_identifier":{"issn":["0178-2770"],"eissn":["1432-0452"]},"external_id":{"isi":["000913424000001"],"arxiv":["2008.01009"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2008.01009"}],"isi":1,"quality_controlled":"1","doi":"10.1007/s00446-022-00441-x","language":[{"iso":"eng"}],"year":"2023","publication_status":"published","department":[{"_id":"DaAl"}],"publisher":"Springer Nature","author":[{"id":"2980135A-F248-11E8-B48F-1D18A9856A87","first_name":"Vitalii","last_name":"Aksenov","full_name":"Aksenov, Vitalii"},{"first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian"},{"last_name":"Drozdova","first_name":"Alexandra","full_name":"Drozdova, Alexandra"},{"first_name":"Amirkeivan","last_name":"Mohtashami","full_name":"Mohtashami, Amirkeivan"}],"date_created":"2023-01-22T23:00:55Z","date_updated":"2023-08-14T12:54:32Z","volume":36,"scopus_import":"1","day":"01","article_processing_charge":"No","publication":"Distributed Computing","citation":{"ama":"Aksenov V, Alistarh D-A, Drozdova A, Mohtashami A. The splay-list: A distribution-adaptive concurrent skip-list. Distributed Computing. 2023;36:395-418. doi:10.1007/s00446-022-00441-x","ieee":"V. Aksenov, D.-A. Alistarh, A. Drozdova, and A. Mohtashami, “The splay-list: A distribution-adaptive concurrent skip-list,” Distributed Computing, vol. 36. Springer Nature, pp. 395–418, 2023.","apa":"Aksenov, V., Alistarh, D.-A., Drozdova, A., & Mohtashami, A. (2023). The splay-list: A distribution-adaptive concurrent skip-list. Distributed Computing. Springer Nature. https://doi.org/10.1007/s00446-022-00441-x","ista":"Aksenov V, Alistarh D-A, Drozdova A, Mohtashami A. 2023. The splay-list: A distribution-adaptive concurrent skip-list. Distributed Computing. 36, 395–418.","short":"V. Aksenov, D.-A. Alistarh, A. Drozdova, A. Mohtashami, Distributed Computing 36 (2023) 395–418.","mla":"Aksenov, Vitalii, et al. “The Splay-List: A Distribution-Adaptive Concurrent Skip-List.” Distributed Computing, vol. 36, Springer Nature, 2023, pp. 395–418, doi:10.1007/s00446-022-00441-x.","chicago":"Aksenov, Vitalii, Dan-Adrian Alistarh, Alexandra Drozdova, and Amirkeivan Mohtashami. “The Splay-List: A Distribution-Adaptive Concurrent Skip-List.” Distributed Computing. Springer Nature, 2023. https://doi.org/10.1007/s00446-022-00441-x."},"article_type":"original","page":"395-418","date_published":"2023-09-01T00:00:00Z","type":"journal_article","abstract":[{"text":"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, although, in real workloads, objects are often accessed at different rates. Efficient distribution-adaptive data structures, such as splay-trees, are known in the sequential case; however, they often are hard to translate efficiently to the concurrent case. 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. Experiments show that the splay-list can leverage distribution-adaptivity for performance, and can outperform the only previously-known distribution-adaptive concurrent design in certain workloads.","lang":"eng"}],"_id":"12330","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"The splay-list: A distribution-adaptive concurrent skip-list","intvolume":" 36","oa_version":"Preprint"}]