DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hwang, Deukyeon | ko |
dc.contributor.author | Kim, Wook-hee | ko |
dc.contributor.author | Won, Youjip | ko |
dc.contributor.author | Nam, Beomseok | ko |
dc.date.accessioned | 2019-06-18T23:50:18Z | - |
dc.date.available | 2019-06-18T23:50:18Z | - |
dc.date.created | 2019-06-19 | - |
dc.date.created | 2019-06-19 | - |
dc.date.issued | 2018-02 | - |
dc.identifier.citation | 16th USENIX Conference on File and Storage Technologies, FAST 2018, pp.187 - 200 | - |
dc.identifier.uri | http://hdl.handle.net/10203/262704 | - |
dc.description.abstract | With the emergence of byte-addressable persistent memory (PM), a cache line, instead of a page, is expected to be the unit of data transfer between volatile and nonvolatile devices, but the failure-atomicity of write operations is guaranteed in the granularity of 8 bytes rather than cache lines. This granularity mismatch problem has generated interest in redesigning block-based data structures such as B+-trees. However, various methods of modifying B+-trees for PM degrade the efficiency of B+trees, and attempts have been made to use in-memory data structures for PM. In this study, we develop Failure-Atomic ShifT (FAST) and Failure-Atomic In-place Rebalance (FAIR) algorithms to resolve the granularity mismatch problem. Every 8-byte store instruction used in the FAST and FAIR algorithms transforms a B+-tree into another consistent state or a transient inconsistent state that read operations can tolerate. By making read operations tolerate transient inconsistency, we can avoid expensive copy-on-write, logging, and even the necessity of read latches so that read transactions can be non-blocking. Our experimental results show that legacy B+-trees with FAST and FAIR schemes outperform the state-of-the-art persistent indexing structures by a large margin. | - |
dc.language | English | - |
dc.publisher | USENIX Association | - |
dc.title | Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree | - |
dc.type | Conference | - |
dc.identifier.wosid | 000540650500013 | - |
dc.identifier.scopusid | 2-s2.0-85054838287 | - |
dc.type.rims | CONF | - |
dc.citation.beginningpage | 187 | - |
dc.citation.endingpage | 200 | - |
dc.citation.publicationname | 16th USENIX Conference on File and Storage Technologies, FAST 2018 | - |
dc.identifier.conferencecountry | US | - |
dc.identifier.conferencelocation | Oakland, CA | - |
dc.contributor.localauthor | Won, Youjip | - |
dc.contributor.nonIdAuthor | Hwang, Deukyeon | - |
dc.contributor.nonIdAuthor | Kim, Wook-hee | - |
dc.contributor.nonIdAuthor | Nam, Beomseok | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.