English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Non-volatile random access memory (NVRAM) offers byte-addressable persistenceat speeds comparable to DRAM. However, with caches remaining volatile,automatic cache evictions can reorder updates to memory, potentially leavingpersistent memory in an inconsistent state upon a system crash. Flush and fenceinstructions can be used to force ordering among updates, but are expensive.This has motivated significant work studying how to write correct and efficientpersistent programs for NVRAM.  In this paper, we present FliT, a C++ library that facilitates writingefficient persistent code. Using the library's default mode makes anylinearizable data structure durable with minimal changes to the code. FliTavoids many redundant flush instructions by using a novel algorithm to trackdirty cache lines. The FliT library also allows for extra optimizations, butachieves good performance even in its default setting.  To describe the FliT library's capabilities and guarantees, we define apersistent programming interface, called the P-V Interface, which FliTimplements. The P-V Interface captures the expected behavior of code in whichsome instructions' effects are persisted and some are not. We show that theinterface captures the desired semantics of many practical algorithms in theliterature.  We apply the FliT library to four different persistent data structures, andshow that across several workloads, persistence implementations, and datastructure sizes, the FliT library always improves operation throughput, by atleast $2.1\times$ over a naive implementation in all but one workload.

FliT: A Library for Simple and Efficient Persistent Algorithms