PB<sup><bold>+</bold></sup>-Tree: PCM-Aware B<sup><bold>+</bold></sup>-Tree
Pages 2466 - 2479
Abstract
Phase change memory (PCM) is non-volatile memory that is byte-addressable. It is two to four times denser than DRAM, orders of magnitude better than NAND Flash memory in read latency, and 10 times better than NAND Flash memory in write endurance. However, it still limits the number of write operations to at most 106 times per PCM cell. To extend its lifetime, it is necessary to evenly distribute write operations over all the memory cells. Up to now, the B<sup>+</sup>-Tree index structure has been used to quickly locate a search key in a relational database management system (RDBMS). All the record keys in each node are sorted and packed upon insertion in, and deletion from, the B<sup>+</sup>-Tree. In addition, a counter keeps track of the number of valid keys in the B<sup>+</sup>-Tree. Consequently, a B<sup>+</sup>-Tree algorithm results in a large number of write operations, which deteriorates the endurance of PCM. This restricts the usage of PCM on a database server and deteriorates performance of database servers. In this paper, we propose a novel PCM-aware B<sup>+</sup>-Tree index structure, called PB<sup>+</sup>-Tree, to provide wear-leveling in PCM. According to our experiment results, PB<sup>+</sup>-Tree is much faster than the existing B<sup>+</sup>-Tree algorithms for PCM and NAND Flash memory with versatile workloads. More importantly, our scheme also greatly reduces the number of write operations compared to other B<sup>+</sup>-Tree algorithms. All of these results suggest that PB<sup>+</sup>-Tree is the B<sup>+</sup>-Tree algorithm best fitted to PCM.
References
[1]
L. Arge, “The buffer tree: A technique for designing batched external data structures,” Algorithmica, vol. 37, no. 1, pp. 1–24, 2003.
[2]
F. Bedeschi, R. Fackenthal, C. Resta, E.M. Donze, M. Jagasivamani, E. Buda, F. Pellizzer, D. Chow, A. Cabrini, G. Calvi, R. Faravelli, A. Fantini, G. Torelli, D. Mills, R. Gastaldi, and G. Casagrande, “A multi-level-cell bipolar-selected phase-change memory,” in Proc. IEEE Int. Solid-State Circuits Conf., 2008, pp. 428–625.
[3]
S. Chen, P. B. Gibbons, and S. Nath, “ Rethinking database algorithms for phase change memory,” in Proc. 5th Biennial Conf. Innovative Data Syst. Res., 2011, pp. 21–31.
[4]
S. Cho and H. Lee, “ Flip-n-write: A simple deterministic technique to improve PRAM write performance, energy and endurance,” in Proc. 42nd Annu. IEEE/ACM Int. Symp. Microarchit., 2009, pp. 347–357.
[5]
G. S. Choi, I. Lee, M. Sung, and C. Im, “A hybrid SSD with PRAM and NAND flash memory, ” Microprocess. Microsyst., vol. 36, no. 3, pp. 257–266, 2012.
[6]
G. S. Choi, B.-W. On, K. Choi, and S. Yi, “PTL: PRAM translation layer,” Microprocess. Microsyst, vol. 37, pp. 24–32, 2013.
[7]
D. Comer, “Ubiquitous B-Tree,” ACM Comput. Surv., vol. 11, no. 2, pp. 121–137, 1979.
[8]
EETimes. (2006). Samsung introduces working prototype of PRAM [Online]. Available: http://www.eetimes.com/electronics-products/memory- products/4087298/Samsu ng-introduces-working-prototype-of-PRAM
[9]
H. Chung, B. H. Jeong, B. Min, Y. Choi, B.-H. Cho, J. Shin, J. Kim, J. Sunwoo, J.-M. Park, Q. Wang, Y.-J. Lee, S. Cha, D. Kwon, S. Kim, S. Kim, Y. Rho, M.-H. Park, J. Kim, I. Song, S. Jun, J. Lee, K. Kim, K.-W. Lim, W.-R. Chung, C. Choi, H. Cho, I. Shin, W. Jun, S. Hwang, K.-W. Song, K. Lee, S.-W. Chang, W.-Y. Cho, J.-H. Yoo, and Y.-H. Jun, “ A 58 nm 1.8 v 1 GB pram with 6.4 mb/s program BW,” in Proc. IEEE Int. Solid-State Circuits Conf. Digest Tech. Papers, Feb. 2011, pp. 500 –502.
[10]
E. Gal and S. Toledo, “ Algorithms and data structures for flash memories,” ACM Comput. Surv. , vol. 37, no. 2, pp. 138–163, 2005.
[11]
Intel. (2010). Intel to sample phase change memory this year [Online]. Available: http://www.dailytech.com/Intel+to+Sample+Phase+Change+Memory+This+Year/art icle6371.htm
[12]
(2013). Intel Labs Pittsburgh. PCM-DB Project [Online]. Available: http:// www.pittsburgh.intel-research.net/projects/hi-spade/pcm-db/index.htm
[13]
International Data Corporation, “Worldwide Solid State Drive 20112015 Forecast and Analysis,” 2011.
[14]
D. Kang, D. Jung, J. Kang, and J. Kim, “ $\mu$ -tree: An ordered index structure for NAND flash memory,” in Proc. 7th ACM/IEEE Int. Conf. Embedded Softw., 2007, pp. 144–153.
[15]
B. C. Lee, E. Ipek, O. Mutlu, and D. Burger, “Architecting phase change memory as a scalable DRAM alternative,” in Proc. 36th Annu. Int. Symp. Comput. Archit., 2009, pp. 2–13.
[16]
S. Lee and B. Moon, “ Design of flash based DBMS: An in-page logging approach,” in Proc. ACM SIGMOD Int. Conf. Manage. Data, 2007, pp. 55–66.
[17]
S. Lee, B. Moon, and C. Park, “Advances in flash memory SSD technology for enterprise database applications,” in Proc. ACM SIGMOD Int. Conf. Manage. Data, 2009, pp. 863–870.
[18]
S. Lee, B. Moon, C. Park, J. Kim, and S. Kim, “A case for flash memory SSD in enterprise database applications,” in Proc. ACM SIGMOD Int. Conf. Manage. Data, 2008, pp. 1075–1086.
[19]
Y. Li, B. He, R. J. Yang, Q. Luo, and K. Yi, “Tree indexing on solid state drives,” Proc. VLDB Endowment, vol. 3, nos. 1/2, pp. 1195–1206, 2010 .
[20]
S. Nath and A. Kansal, “FlashDB: Dynamic self-tuning database for NAND flash,” in Proc. 6th Int. Conf. Inf. Process. Sensor Netw., 2007, pp. 410–419 .
[21]
Numonyx, “ Numonyx Omneo P8P PCM 128-Mbit parallel phase change memory,” 2005.
[22]
P. O’Neil, E. Cheng, D. Gawlick, and E. O’Neil, “The log-structured merge-tree (LSM-tree),” Acta Inf., vol. 33, no. 4, pp. 351–385, 1996.
[23]
Y. Park, S.-H. Lim, C. Lee, and K. H. Park, “PFFS: A scalable flash memory file system for the hybrid architecture of phase-change RAM and NAND flash,” in Proc. ACM Symp. Appl. Comput., 2008, pp. 1498–1503.
[24]
M. K. Qureshi, J. P. Karidis, M. Franceschini, V. Srinivasan, L. Lastras, and B. Abali, “Enhancing lifetime and security of PCM-based main memory with Start-gap wear leveling,” in Proc. 42nd Annu. IEEE/ACM Int. Symp. Microarchit., 2009, pp. 14–23.
[25]
M. K. Qureshi, V. Srinivasan, and J. A. Rivers, “Scalable high performance main memory system using phase-change memory technology,” in Proc. 36th Annu. Int. Symp. Comput. Archit., 2009, pp. 24–33.
[26]
H. Roh, S. Park, S. Kim, M. Shin, and S. Lee, “B+-tree index optimization by exploiting internal parallelism of flash-based solid state drives, ” Proc. VLDB Endowment, vol. 5, no. 4, pp. 286–297, 2012.
[27]
Samsung. (2008). Samsung MZ-7PC512 User Manual [Online]. Available: http:// www.helpowl.com/p/Samsung/MZ-7PC512D/Research/122290
[28]
Samsung. (2010). Samsung Ships $\mathrm{Industry^{\prime }s}$ First Multi-chip Package with a PRAM Chip for Handsets [Online]. Available: http://www.samsung.com/us/news/presskitRead.do?news_ seq=18828&news_group=&news_type=&news_ ctgry=&page=2&rdoPeriod=ALL&from_dt&to_dt=& search_keyword=
[29]
Seagate. (2007). Seagate Barracuda 7200.10 Data Sheet) [Online]. Available: http://www.seagate.com/docs/pdf/datasheet/disc/ds_barracuda_7200_10.pdf
[30]
C. Villa, D. Mills, G. Barkley, H. Giduturi, S. Schippers, and D. Vimercati, “A 45 nm 1 Gb 1.8 V Phase-change memory,” in Proc. IEEE Int. Solid-State Circuits Conf., 2010, pp. 270–271.
[31]
C.-H. Wu, T.-W. Kuo, and L. P. Chang, “An efficient b-tree layer implementation for flash-memory storage systems,” ACM Trans. Embedded Comput. Syst., vol. 6, no. 3, p. 19, Jul. 2007.
[32]
B. D. Yang, J. E. Lee, J. S. Kim, J. Cho, S. Y. Lee, and B. G. Yu, “ A low power Phase-change random access memory using a data-comparison write scheme,” in Proc. 36th Annu. Int. Symp. Comput. Archit., 2007, pp. 3014 –3017.
[33]
P. Zhou, B. Zhao, J. Yang, and Y. Zhang, “A durable and energy efficient main memory using phase change memory technology,” in Proc. 36th Annu. Int. Symp. Comput. Archit. , 2009, pp. 14–23.
Index Terms
- PB
+ -Tree: PCM-Aware B+ -Tree
Index terms have been assigned to the content through auto-classification.
Recommendations
NPC: A
N on-ConflictingP rocessing-in-MemoryC ontroller in DDR Memory SystemsProcessing-in-Memory (PIM) has emerged as a promising solution to address the memory wall problem. Existing memory interfaces must support new PIM commands to utilize PIM, making the definition of PIM commands according to memory modes a major issue in ...
LL-PCM: Low-Latency Phase Change Memory Architecture
DAC '19: Proceedings of the 56th Annual Design Automation Conference 2019PCM is a promising non-volatile memory technology, as it can offer a unique trade-off between density and latency compared with DRAM and flash memory. Albeit PCM is much faster than flash memory, it is still notably slower than DRAM, which can ...
Making B+-tree efficient in PCM-based main memory
ISLPED '14: Proceedings of the 2014 international symposium on Low power electronics and designPhase change memory (PCM) is a promising technology for building future large-scale and low-power main memory systems. Main memory databases (MMDBs) can benefit from the high density of PCM. However, its long write latency, high write energy, and ...
Comments
Information & Contributors
Information
Published In
Copyright © 2015.
Publisher
IEEE Educational Activities Department
United States
Publication History
Published: 01 September 2015
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 27 Feb 2025