Execution of NVRAM Programs with Persistent Stack

Vitaly Aksenov, Ohad Ben-Baruch, Danny Hendler, Ilya Kokorin, Matan Rusanovsky

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

Abstract

Non-Volatile Random Access Memory (NVRAM) is a novel type of hardware that combines the benefits of traditional persistent memory (persistency of data over hardware failures) and DRAM (fast random access). In this work, we describe an algorithm that can be used to execute NVRAM programs and recover the system after a hardware failure while taking the architecture of real-world NVRAM systems into account. Moreover, the algorithm can be used to execute NVRAM-destined programs on commodity persistent hardware, such as hard drives. That allows us to test NVRAM algorithms using only cheap hardware, without having access to the NVRAM. We report the usage of our algorithm to implement and test NVRAM CAS algorithm.

Original languageEnglish
Title of host publicationParallel Computing Technologies - 16th International Conference, PaCT 2021, Proceedings
EditorsVictor Malyshkin
PublisherSpringer Science and Business Media Deutschland GmbH
Pages117-131
Number of pages15
ISBN (Print)9783030863586
DOIs
StatePublished - 1 Jan 2021
Event16th International Conference on Parallel Computing Technologies, PaCT 2021 - Kaliningrad, Russian Federation
Duration: 13 Sep 202118 Sep 2021

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12942 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference16th International Conference on Parallel Computing Technologies, PaCT 2021
Country/TerritoryRussian Federation
CityKaliningrad
Period13/09/2118/09/21

Keywords

  • Concurrency
  • NVRAM
  • Persistency
  • Shared memory

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Execution of NVRAM Programs with Persistent Stack'. Together they form a unique fingerprint.

Cite this