Flat-Combining-Based Persistent Data Structures for Non-volatile Memory

In this work, we present the first persistent (also called durable or recoverable) object implementations that employ the flat-combining (FC) synchronization paradigm. Specifically, we introduce a detectable FC-based implementation of concurrent LIFO stack, FIFO queue, and double-ended queue. Our em...

Full description

Saved in:
Bibliographic Details
Published inStabilization, Safety, and Security of Distributed Systems Vol. 13046; pp. 505 - 509
Main Authors Rusanovsky, Matan, Attiya, Hagit, Ben-Baruch, Ohad, Gerby, Tom, Hendler, Danny, Ramalhete, Pedro
Format Book Chapter
LanguageEnglish
Published Switzerland Springer International Publishing AG 2021
Springer International Publishing
SeriesLecture Notes in Computer Science
Online AccessGet full text

Cover

More Information
Summary:In this work, we present the first persistent (also called durable or recoverable) object implementations that employ the flat-combining (FC) synchronization paradigm. Specifically, we introduce a detectable FC-based implementation of concurrent LIFO stack, FIFO queue, and double-ended queue. Our empirical evaluation establishes that our novel FC-based implementations require a much smaller number of costly persistence instructions than competing algorithms and are therefore able to significantly outperform them.
ISBN:9783030910808
3030910806
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-030-91081-5_38