BROWSE

Related Researcher

Author

Nam, Beomseok
Data Intensive Computing Lab
Research Interests
  • Distributed and parallel computing, high performance computing, database systems, OS and storage systems

ITEM VIEW & DOWNLOAD

clfB-tree: Cacheline friendly persistent B-tree for NVRAM

DC FieldValueLanguage
dc.contributor.authorKim, Wook-Heeko
dc.contributor.authorSeo, Jihyeko
dc.contributor.authorKim, Jinwoongko
dc.contributor.authorNam, Beomseokko
dc.date.available2018-03-29T08:41:31Z-
dc.date.created2018-03-27ko
dc.date.issued201803ko
dc.identifier.citationACM TRANSACTIONS ON STORAGE, v.14, no.1, pp.5 -ko
dc.identifier.issn1553-3077ko
dc.identifier.urihttp://scholarworks.unist.ac.kr/handle/201301/23900-
dc.identifier.urihttps://dl.acm.org/citation.cfm?doid=3190860.3129263ko
dc.description.abstractEmerging byte-addressable non-volatile memory (NVRAM) is expected to replace block device storages as an alternative low-latency persistent storage device. If NVRAM is used as a persistent storage device, a cache line instead of a disk page will be the unit of data transfer, consistency, and durability. In this work, we design and develop clfB-tree—a B-tree structure whose tree node fits in a single cache line. We employ existing write combining store buffer and restricted transactional memory to provide a failure-atomic cache line write operation. Using the failure-atomic cache line write operations, we atomically update a clfB-tree node via a single cache line flush instruction without major changes in hardware. However, there exist many processors that do not provide SW interface for transactional memory. For those processors, our proposed clfB-tree achieves atomicity and consistency via in-place update, which requires maximum four cache line flushes. We evaluate the performance of clfB-tree on an NVRAM emulation board with ARM Cortex A-9 processor and a workstation that has Intel Xeon E7-4809 v3 processor. Our experimental results show clfB-tree outperforms wB-tree and CDDS B-tree by a large margin in terms of both insertion and search performance.ko
dc.languageENGko
dc.publisherASSOC COMPUTING MACHINERYko
dc.subjectNon-volatile memoryko
dc.subjectdata structureko
dc.subjectpersistent indexingko
dc.titleclfB-tree: Cacheline friendly persistent B-tree for NVRAMko
dc.typeARTICLEko
dc.identifier.pid1248null
dc.identifier.rimsid30052ko
dc.identifier.scopusid2-s2.0-85042936056ko
dc.identifier.wosid000433517600005ko
dc.type.rimsAko
dc.identifier.doihttp://dx.doi.org/10.1145/3129263ko
Appears in Collections:
ECE_Journal Papers

find_unist can give you direct access to the published full text of this article. (UNISTARs only)

Show simple item record

qr_code

  • mendeley

    citeulike

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

MENU