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/

Zendy Plus

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

Zendy Tools

Zendy Open

Flat combining (FC) is a synchronization paradigm in which a single thread,holding a global lock, collects requests by multiple threads for accessing aconcurrent data structure and applies their combined requests to it. AlthoughFC is sequential, it significantly reduces synchronization overheads and cacheinvalidations and thus often provides better performance than that of lock-freeimplementations. The recent emergence of non-volatile memory (NVM) technologiesincreases the interest in the development of persistent concurrent objects.These are objects that are able to recover from system failures and ensureconsistency by retaining their state in NVM and fixing it, if required, uponrecovery. Of particular interest are detectable objects that, in addition toensuring consistency, allow recovery code to infer if a failed operation tookeffect before the crash and, if it did, obtain its response. In this work, wepresent the first FC-based persistent object implementations. Specifically, weintroduce a detectable FC-based implementation of a concurrent LIFO stack, aconcurrent FIFO queue, and a double-ended queue. Our empirical evaluationestablishes that due to flat combining, the novel implementations require amuch smaller number of costly persistence instructions than competingalgorithms and are therefore able to significantly outperform them.

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