Document Open Access Logo

Foundations of Persistent Programming (Dagstuhl Seminar 21462)

Authors Hans-J. Boehm, Ori Lahav, Azalea Raad and all authors of the abstracts in this report



PDF
Thumbnail PDF

File

DagRep.11.10.94.pdf
  • Filesize: 2.47 MB
  • 17 pages

Document Identifiers

Author Details

Hans-J. Boehm
  • Google - Mountain View, US
Ori Lahav
  • Tel Aviv University, IL
Azalea Raad
  • Imperial College London, GB
and all authors of the abstracts in this report

Cite AsGet BibTex

Hans-J. Boehm, Ori Lahav, and Azalea Raad. Foundations of Persistent Programming (Dagstuhl Seminar 21462). In Dagstuhl Reports, Volume 11, Issue 10, pp. 94-110, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
https://doi.org/10.4230/DagRep.11.10.94

Abstract

Although early electronic computers commonly had persistent core memory that retained its contents with power off, modern computers generally do not. DRAM loses its contents when power is lost. However, DRAM has been difficult to scale to smaller feature sizes and larger capacities, making it costly to build balanced systems with sufficient amounts of directly accessible memory. Commonly proposed replacements, including Intel’s Optane product, are once again persistent. It is however unclear, and probably unlikely, that the fastest levels of the memory hierarchy will be able to adopt such technology. No such non-volatile (NVM) technology has yet taken over, but there remains a strong economic incentive to move hardware in this direction, and it would be disappointing if we continued to be constrained by the current DRAM scaling. Since current computer systems often invest great effort, in the form of software complexity, power, and computation time, to "persist" data from DRAM by rearranging and copying it to persistent storage, like magnetic disks or flash memory, it is natural and important to ask whether we can leverage persistence of part of primary memory to avoid this overhead. Such efforts are complicated by the fact that real systems are likely to remain only partially persistent; some memory components, like processor caches and device registers. may remain volatile. This seminar focused on various aspects of programming for such persistent memory systems, ranging from programming models for reasoning about and formally verifying programs that leverage persistence, to techniques for converting existing multithreaded programs (particularly, lock-free ones) to corresponding programs that also directly persist their state in NVM. We explored relationships between this problem and prior work on concurrent programming models.

Subject Classification

ACM Subject Classification
  • Theory of computation → Concurrency
  • Hardware → Non-volatile memory
  • Theory of computation → Program semantics
Keywords
  • concurrency; non-volatile-memory; persistency; semantics; weak memory models

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail