Leveraging Write Heterogeneity of Phase Change Memory on Supporting Self-Balancing Binary Tree
Autor: | Chun-Feng Wu, Chieh-Fu Chang, Ming-Chang Yang, Che-Wei Chang, Yuan-Hao Chang |
---|---|
Rok vydání: | 2022 |
Předmět: |
Hardware_MEMORYSTRUCTURES
Binary tree Computer science Energy consumption Parallel computing Data structure Computer Graphics and Computer-Aided Design Phase-change memory Tree (data structure) Binary search tree Node (computer science) Overhead (computing) Electrical and Electronic Engineering Software |
Zdroj: | IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 41:1757-1770 |
ISSN: | 1937-4151 0278-0070 |
DOI: | 10.1109/tcad.2021.3097298 |
Popis: | With the increasing demand of massive/big data applications, non-volatile memory (NVM), such as phase change memory (PCM), has become a promising candidate to replace DRAM because of its low leakage power, non-volatility, and high density. However, most of the existing memory read/write intensive algorithms and data structures are not aware of the PCM write heterogeneity in terms of both energy consumption and latency. In particular, self-balancing binary search trees, which are widely used to manage massive data in the big-data era, were designed without the consideration of PCM characteristics. Thus, the multiple rotations of the tree balancing process would degrade the memory performance. This work explores the relations among nodes and analyzes tree operations, and the node indexing and address mapping are redesigned to reduce the tree management overhead on single-level cell (SLC) PCM by decreasing the number of bit flips of tree rotations. When multi-level cell (MLC) PCM is included, our address mapping algorithm is developed to reduce the total energy consumption and latency with considerations of the heterogeneous write operations of different cell states. Experimental results show that our solution significantly outperforms the original implementation of a self-balancing binary search tree when the amount of data is large. |
Databáze: | OpenAIRE |
Externí odkaz: |