dc.citation.conferencePlace |
US |
- |
dc.citation.endPage |
44 |
- |
dc.citation.startPage |
31 |
- |
dc.citation.title |
USENIX Conference on File and Storage Technologies |
- |
dc.contributor.author |
Nam, Moohyeon |
- |
dc.contributor.author |
Cha, Hokeun |
- |
dc.contributor.author |
Choi, Young-Ri |
- |
dc.contributor.author |
Noh, Sam H. |
- |
dc.contributor.author |
Nam, Beomseok |
- |
dc.date.accessioned |
2024-02-01T00:38:12Z |
- |
dc.date.available |
2024-02-01T00:38:12Z |
- |
dc.date.created |
2019-07-10 |
- |
dc.date.issued |
2019-02-25 |
- |
dc.description.abstract |
Low latency storage media such as byte-addressable persistent memory (PM) requires rethinking of various data structures in terms of optimization. One of the main challenges in implementing hash-based indexing structures on PM is how to achieve efficiency by making effective use of cachelines while guaranteeing failure-atomicity for dynamic hash expansion and shrinkage. In this paper, we present Cacheline-Conscious Extendible Hashing (CCEH) that reduces the overhead of dynamic memory block management while guaranteeing constant hash table lookup time. CCEH guarantees failure-atomicity without making use of explicit logging. Our experiments show that CCEH effectively adapts its size as the demand increases under the finegrained ailure-atomicity constraint and its maximum query latency is an order of magnitude lower compared to the stateof-the-art ashing techniques. |
- |
dc.identifier.bibliographicCitation |
USENIX Conference on File and Storage Technologies, pp.31 - 44 |
- |
dc.identifier.scopusid |
2-s2.0-85075853734 |
- |
dc.identifier.uri |
https://scholarworks.unist.ac.kr/handle/201301/80120 |
- |
dc.language |
영어 |
- |
dc.publisher |
USENIX Association |
- |
dc.title |
Write-Optimized Dynamic Hashing for Persistent Memory |
- |
dc.type |
Conference Paper |
- |
dc.date.conferenceDate |
2019-02-25 |
- |