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

Matan Rusanovsky, Hagit Attiya, Ohad Ben-Baruch, Tom Gerby, Danny Hendler, Pedro Ramalhete

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationStabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, SSS 2021, Proceedings
EditorsColette Johnen, Elad Michael Schiller, Stefan Schmid
PublisherSpringer Science and Business Media Deutschland GmbH
Pages505-509
Number of pages5
ISBN (Print)9783030910808
DOIs
StatePublished - 1 Jan 2021
Event23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021 - Virtual, Online
Duration: 17 Nov 202120 Nov 2021

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume13046 LNCS

Conference

Conference23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021
CityVirtual, Online
Period17/11/2120/11/21

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Flat-Combining-Based Persistent Data Structures for Non-volatile Memory'. Together they form a unique fingerprint.

Cite this