Thumbnail
Access Restriction
Subscribed

Author Kolli, Aasheesh ♦ Izraelevitz, Joseph ♦ Kelly, Terence
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Transactions ♦ Persistent memory ♦ Crash-resilience ♦ Non-volatile memory ♦ Failure-atomicity
Abstract Persistent memory invites applications to manipulate persistent data via load and store instructions. Because failures during updates may destroy transient data (e.g., in CPU registers), preserving data integrity in the presence of failures requires failure-atomic bundles of updates. Prior failure atomicity approaches for persistent memory entail overheads due to logging and CPU cache flushing. Persistent caches can eliminate the need for flushing, but conventional logging remains complex and memory intensive. We present the design and implementation of JUSTDO logging, a new failure atomicity mechanism that greatly reduces the memory footprint of logs, simplifies log management, and enables fast parallel recovery following failure. Crash-injection tests confirm that JUSTDO logging preserves application data integrity and performance evaluations show that it improves throughput 3x or more compared with a state-of-the-art alternative for a spectrum of data-intensive algorithms.
Description Affiliation: University of Rochester, Rochester, NY, USA (Izraelevitz, Joseph) || Hewlett Packard Labs, Palo Alto, CA, USA (Kelly, Terence) || University of Michigan, Ann Arbor, MI, USA (Kolli, Aasheesh)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1975-04-01
Publisher Place New York
Journal ACM SIGOPS Operating Systems Review (OPSR)
Volume Number 50
Issue Number 2
Page Count 16
Starting Page 427
Ending Page 442


Open content in new tab

   Open content in new tab
Source: ACM Digital Library