2026-07-25T22:34:06Z https://drops.dagstuhl.de/oai

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

Brief Announcement: Persistent Software Combining Fatourou, Panagiota Kallimanis, Nikolaos D. Kosmas, Eleftherios Persistent objects recoverable algorithms durability synchronization protocols software combining universal constructions wait-freedom stacks queues We study the performance power of software combining in designing recoverable algorithms and data structures. We present two recoverable synchronization protocols, one blocking and another wait-free, which illustrate how to use software combining to achieve both low persistence and synchronization cost. Our experiments show that these protocols outperform by far state-of-the-art recoverable universal constructions and transactional memory systems. We built recoverable queues and stacks, based on these protocols, that exhibit much better performance than previous such implementations. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Panagiota Fatourou and Nikolaos D. Kallimanis and Eleftherios Kosmas 2021 Is Part Of LIPIcs, Volume 209, 35th International Symposium on Distributed Computing (DISC 2021) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.DISC.2021.56 urn:nbn:de:0030-drops-148580 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.56 eng https://creativecommons.org/licenses/by/4.0/legalcode