Persistent memory: A survey of programming support and implementations
The recent rise of byte-addressable non-volatile memory technologies is blurring the
dichotomy between memory and storage. In particular, they allow programmers to have …
dichotomy between memory and storage. In particular, they allow programmers to have …
Atlas: Leveraging locks for non-volatile memory consistency
DR Chakrabarti, HJ Boehm, K Bhandari - ACM SIGPLAN Notices, 2014 - dl.acm.org
Non-volatile main memory, such as memristors or phase change memory, can revolutionize
the way programs persist data. In-memory objects can themselves be persistent without the …
the way programs persist data. In-memory objects can themselves be persistent without the …
Design and implementation of transactional constructs for C/C++
Y Ni, A Welc, AR Adl-Tabatabai, M Bach… - Proceedings of the 23rd …, 2008 - dl.acm.org
This paper presents a software transactional memory system that introduces first-class C++
language constructs for transactional programming. We describe new C++ language …
language constructs for transactional programming. We describe new C++ language …
C4: verified transactional objects
M Lesani, L Xia, A Kaseorg, CJ Bell… - Proceedings of the …, 2022 - dl.acm.org
Transactional objects combine the performance of classical concurrent objects with the high-
level programmability of transactional memory. However, verifying the correctness of …
level programmability of transactional memory. However, verifying the correctness of …
Operating system transactions
DE Porter, OS Hofmann, CJ Rossbach, A Benn… - Proceedings of the …, 2009 - dl.acm.org
Applications must be able to synchronize accesses to operating system resources in order to
ensure correctness in the face of concurrency and system failures. System transactions …
ensure correctness in the face of concurrency and system failures. System transactions …
TLRW: return of the read-write lock
D Dice, N Shavit - Proceedings of the twenty-second annual ACM …, 2010 - dl.acm.org
TL2 and similar STM algorithms deliver high scalability based on write-locking and invisible
readers. In fact, no modern STM design locks to read along its common execution path …
readers. In fact, no modern STM design locks to read along its common execution path …
Adaptive locks: Combining transactions and locks for efficient concurrency
T Usui, R Behrends, J Evans, Y Smaragdakis - Journal of Parallel and …, 2010 - Elsevier
Transactional memory is being advanced as an alternative to traditional lock-based
synchronization for concurrent programming. Transactional memory simplifies the …
synchronization for concurrent programming. Transactional memory simplifies the …
Transactional locking with read-write locks in transactional memory systems
D Dice, NN Shavit - US Patent 8,973,004, 2015 - Google Patents
(57) ABSTRACT A system and method for transactional memory using read write locks is
disclosed. Each of a plurality of shared memory areas is associated with a respective read …
disclosed. Each of a plurality of shared memory areas is associated with a respective read …
Scalable techniques for transparent privatization in software transactional memory
We address the recently recognized privatization problem in software transactional memory
(STM) runtimes, and introduce the notion of partially visible reads (PVRs) to heuristically …
(STM) runtimes, and introduce the notion of partially visible reads (PVRs) to heuristically …
On parallel snapshot isolation and release/acquire consistency
A Raad, O Lahav, V Vafeiadis - … on Programming, ESOP 2018, Held as …, 2018 - Springer
Parallel snapshot isolation (PSI) is a standard transactional consistency model used in
databases and distributed systems. We argue that PSI is also a useful formal model for …
databases and distributed systems. We argue that PSI is also a useful formal model for …