비대칭적 성능의 고용량 비휘발성 메모리를 위한 계층적 구조의 이진 탐색 트리A Hierarchical Binary-search Tree for the High-Capacity and Asymmetric Performance of NVM
- Other Titles
- A Hierarchical Binary-search Tree for the High-Capacity and Asymmetric Performance of NVM
- Authors
- 정민성; 이미정; 이은지
- Issue Date
- Apr-2019
- Publisher
- 대한임베디드공학회
- Citation
- 대한임베디드공학회논문지, v.14, no.2, pp.79 - 86
- Journal Title
- 대한임베디드공학회논문지
- Volume
- 14
- Number
- 2
- Start Page
- 79
- End Page
- 86
- URI
- http://scholarworks.bwise.kr/ssu/handle/2018.sw.ssu/39057
- DOI
- 10.14372/IEMEK.2019.14.2.79
- ISSN
- 1975-5066
- Abstract
- For decades, in-memory data structures have been designed for DRAM-based main memory that provides symmetric read/write performances and has no limited write endurance.
However, such data structures provide sub-optimal performance for NVM as it has different characteristics to DRAM. With this motivation, we rethink a conventional red-black tree in terms of its efficacy under NVM settings. The original red-black tree constantly rebalances sub-trees so as to export fast access time over dataset, but it inevitably increases the write traffic, adversely affecting the performance for NVM with a long write latency and limited endurance.
To resolve this problem, we present a variant of the red-black tree called a hierarchical balanced binary search tree. The proposed structure maintains multiple keys in a single node so as to amortize the rebalancing cost. The performance study reveals that the proposed hierarchical binary search tree effectively reduces the write traffic by effectively reaping the high capacity of NVM.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Information Technology > Department of Smart Systems Software > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.