Name
Abstract | ||
|---|---|---|
Non-volatile memory is expected to co-exist or replace DRAM in upcoming architectures. Durable concurrent data structures for non-volatile memories are essential building blocks for constructing adequate software for use with these architectures. In this paper, we propose a new approach for durable concurrent sets and use this approach to build the most efficient durable hash tables available today. Evaluation shows a performance improvement factor of up to 3.3x over existing technology.
|
Year | DOI | Venue |
|---|---|---|
2019 | 10.1145/3360554 | Proceedings of the ACM on Programming Languages |
Keywords | Field | DocType |
Concurrent Data Structures, Durable Linearizability, Durable Sets, Hash Maps, Lock Freedom, Non-Volatile Memory | Computer science,Non-blocking algorithm,Computer hardware | Journal |
Volume | Issue | Citations |
3 | OOPSLA | 1 |
PageRank | References | Authors |
0.35 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yoav Zuriel | 1 | 1 | 0.69 |
| Michal Friedman | 2 | 18 | 3.07 |
| Gali Sheffi | 3 | 1 | 0.69 |
| Nachshon Cohen | 4 | 1 | 0.35 |
| Erez Petrank | 5 | 1601 | 107.96 |