Person
Nachshon Cohen
This person is no longer with EPFL
Related publications (10)
Fine-Grain Checkpointing with In-Cache-Line Logging
James Richard Larus, David Teksen Aksun, Nachshon Cohen
Non-Volatile Memory offers the possibility of implementing high-performance, durable data structures. However, achieving performance comparable to well-designed data structures in non-persistent (transient) memory is difficult, primarily because of the cos ...
ACM2019OneFile: A Wait-free Persistent Transactional Memory
A persistent transactional memory (PTM) library provides an easy-to-use interface to programmers for using byte-addressable non-volatile memory (NVM). Previously proposed PTMs have, so far, been blocking. We present OneFile, the first wait-free PTM with in ...
IEEE COMPUTER SOC2019Object-Oriented Recovery for Non-volatile Memory
James Richard Larus, David Teksen Aksun, Nachshon Cohen
New non-volatile memory (NVM) technologies enable direct, durable storage of data in an application's heap. Durable, randomly accessible memory facilitates the construction of applications that do not lose data at system shutdown or power failure. Existing ...
ACM2018The Inherent Cost of Remembering Consistently
Rachid Guerraoui, Mihail Igor Zablotchi, Nachshon Cohen
Non-volatile memory (NVM) promises fast, byte-addressable and durable storage, with raw access latencies in the same order of magnitude as DRAM. But in order to take advantage of the durability of NVM, programmers need to design persistent objects which ma ...
2018The Inherent Cost of Remembering Consistently
Rachid Guerraoui, Mihail Igor Zablotchi, Nachshon Cohen
Non-volatile memory (NVM) promises fast, byte-addressable and durable storage, with raw access latencies in the same order of magnitude as DRAM. But in order to take advantage of the durability of NVM, programmers need to design persistent objects which ma ...
2018Every data structure deserves lock-free memory reclamation
Memory-management support for lock-free data structures is well known to be a tough problem. Recent work has successfully reduced the overhead of such schemes. However, applying memory-management support to a data structure remains complex and, in many cas ...
2018Approximating Steiner trees and forests with minimum number of Steiner points
Let R be a finite set of terminals in a convex metric space (M, d). We give approximation algorithms for problems of finding a minimum size set S subset of M of additional points such that the unit-disc graph G[R boolean OR S] of R boolean OR S satisfies s ...
ACADEMIC PRESS INC ELSEVIER SCIENCE2018A GPU-Friendly Skiplist Algorithm
We propose a design for a fine-grained lock-based skiplist optimized for Graphics Processing Units (GPUs). While GPUs are often used to accelerate streaming parallel computations, it remains a significant challenge to efficiently offload concurrent computa ...
Ieee2017Efficient Logging in Non-Volatile Memory by Exploiting Coherency Protocols
James Richard Larus, Nachshon Cohen
Non-volatile memory (NVM) technologies such as PCM, ReRAM and STT-RAM allow processors to directly write values to persistent storage at speeds that are significantly faster than previous durable media such as hard drives or SSDs. Many applications of NVM ...
ACM2017Limitations of Partial Compaction: Towards Practical Bounds
Compaction of a managed heap is a costly operation to be avoided as much as possible in commercial runtimes. Instead, partial compaction is often used to defragment parts of the heap and avoid space blowup. Previous study of compaction limitation provided ...
Assoc Computing Machinery2017