Full metadata record
DC Field | Value | Language |
---|---|---|
dc.citation.endPage | 614 | - |
dc.citation.number | 3 | - |
dc.citation.startPage | 601 | - |
dc.citation.title | IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS | - |
dc.citation.volume | 32 | - |
dc.contributor.author | Cho, Soojeong | - |
dc.contributor.author | Kim, Wonbae | - |
dc.contributor.author | Oh, Sehyeon | - |
dc.contributor.author | Kim, Changdae | - |
dc.contributor.author | Koh, Kwangwon | - |
dc.contributor.author | Nam, Beomseok | - |
dc.date.accessioned | 2023-12-21T16:12:26Z | - |
dc.date.available | 2023-12-21T16:12:26Z | - |
dc.date.created | 2020-10-30 | - |
dc.date.issued | 2021-03 | - |
dc.description.abstract | In this article, we propose Failure-atomic Byte-addressable R-tree (FBR-tree) that leverages the byte-addressability, persistence, and high performance of persistent memory while guaranteeing the crash consistency. We carefully control the order of store and cacheline flush instructions and prevent any single store instruction from making an FBR-tree inconsistent and unrecoverable. We also develop a non-blocking lock-free range query algorithm for FBR-tree. Since FBR-tree allows read transactions to detect and ignore any transient inconsistent states, multiple read transactions can concurrently access tree nodes without using shared locks while other write transactions are making changes to them. Our performance study shows that FBR-tree successfully reduces the legacy logging overhead and the lock-free range query algorithm shows up to 2.6x higher query processing throughput than the shared lock-based crabbing concurrency protocol. | - |
dc.identifier.bibliographicCitation | IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, v.32, no.3, pp.601 - 614 | - |
dc.identifier.doi | 10.1109/TPDS.2020.3028699 | - |
dc.identifier.issn | 1045-9219 | - |
dc.identifier.scopusid | 2-s2.0-85092905563 | - |
dc.identifier.uri | https://scholarworks.unist.ac.kr/handle/201301/48662 | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/9214450 | - |
dc.identifier.wosid | 000577863700003 | - |
dc.language | 영어 | - |
dc.publisher | IEEE COMPUTER SOC | - |
dc.title | Failure-Atomic Byte-Addressable R-tree for Persistent Memory | - |
dc.type | Article | - |
dc.description.isOpenAccess | TRUE | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods; Engineering, Electrical & Electronic | - |
dc.relation.journalResearchArea | Computer Science; Engineering | - |
dc.type.docType | Article | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordAuthor | Data structures | - |
dc.subject.keywordAuthor | Metadata | - |
dc.subject.keywordAuthor | Indexing | - |
dc.subject.keywordAuthor | Computer crashes | - |
dc.subject.keywordAuthor | Transient analysis | - |
dc.subject.keywordAuthor | Concurrent computing | - |
dc.subject.keywordAuthor | R-tree | - |
dc.subject.keywordAuthor | persistent memory | - |
dc.subject.keywordAuthor | failure-atomicity | - |
dc.subject.keywordAuthor | multidimensional indexing structure | - |
dc.subject.keywordPlus | NVRAM | - |
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Tel : 052-217-1404 / Email : scholarworks@unist.ac.kr
Copyright (c) 2023 by UNIST LIBRARY. All rights reserved.
ScholarWorks@UNIST was established as an OAK Project for the National Library of Korea.