This artifact provides a way to test different concurrent, persistent and lock-free data structures that were specifically designed for non-volatile memory
Non-volatile memory (NVM), aka persistent memory, is a new paradigm for memory that preserves its co...
Highly concurrent and reliable data objects are vital for parallel programming. Lock-free shared dat...
Recent non-volatile memory (NVM) technologies, such as PCM, STT-MRAM and ReRAM, can act as both main...
Data replication can help database systems meet the stringent temporal constraints of current time-c...
Concurrent data structures provide the means to multi-threaded applications to share data. Typical d...
This paper presents a generic approach for deriving detectably recoverable implementations of many w...
Non-volatile memory is expected to coexist with (or even displace) volatile DRAM for main memory in ...
We present a fully lock-free variant of our recent Montage system for persistent data structures. Th...
Non-volatile memory (NVM), aka persistent memory, is a new paradigm for memory that preserves its co...
\ua9 2017 by John Wiley & Sons, Inc. All rights reserved. Concurrent data structures are the data sh...
Before moving beyond locks, we’ll first describe how to use locks in some common data structures. Ad...
Data replication can help database systems meet the stringent temporal constraints of current rea...
A shared data structure is lock-free if its operations do not require mutual exclusion. If one proce...
Non-volatile memory (NVM), also known as persistent memory, is an emerging paradigm for memory that ...
A concurrent data object is lock-free if it guarantees that at least one, among all concurrent opera...
Non-volatile memory (NVM), aka persistent memory, is a new paradigm for memory that preserves its co...
Highly concurrent and reliable data objects are vital for parallel programming. Lock-free shared dat...
Recent non-volatile memory (NVM) technologies, such as PCM, STT-MRAM and ReRAM, can act as both main...
Data replication can help database systems meet the stringent temporal constraints of current time-c...
Concurrent data structures provide the means to multi-threaded applications to share data. Typical d...
This paper presents a generic approach for deriving detectably recoverable implementations of many w...
Non-volatile memory is expected to coexist with (or even displace) volatile DRAM for main memory in ...
We present a fully lock-free variant of our recent Montage system for persistent data structures. Th...
Non-volatile memory (NVM), aka persistent memory, is a new paradigm for memory that preserves its co...
\ua9 2017 by John Wiley & Sons, Inc. All rights reserved. Concurrent data structures are the data sh...
Before moving beyond locks, we’ll first describe how to use locks in some common data structures. Ad...
Data replication can help database systems meet the stringent temporal constraints of current rea...
A shared data structure is lock-free if its operations do not require mutual exclusion. If one proce...
Non-volatile memory (NVM), also known as persistent memory, is an emerging paradigm for memory that ...
A concurrent data object is lock-free if it guarantees that at least one, among all concurrent opera...
Non-volatile memory (NVM), aka persistent memory, is a new paradigm for memory that preserves its co...
Highly concurrent and reliable data objects are vital for parallel programming. Lock-free shared dat...
Recent non-volatile memory (NVM) technologies, such as PCM, STT-MRAM and ReRAM, can act as both main...
DOI
Add to ORKG