Garbage CollectionMethod using Proxy Block considering Index Data Structure based on Flash Memory
2015, 20(6), pp.1-11
Publisher : The Korean Society Of Computer And Information
Research Area : Computer Science
-
Recently, NAND flash memories are used for storage devices because of fast access speed and low-power. However, applications of FTL on low power computing devices lead to heavy workloads which result in a memory requirement and an implementation overhead. Consequently, studies of B+-Tree on embedded devices without the FTL have been proposed. The studies of B+-Tree are optimized for performance of inserting and updating records, considering to disadvantages of the NAND flash memory that it can not support in-place update. However, if a general garbage collection method is applied to the previous studies of B+-Tree, a performance of the B+-Tree is reduced, because it generates a rearrangement of the B+-Tree by changing of page positions on the NAND flash memory. Therefor, we propose a novel garbage collection method which can apply to the B+-Tree based on the NAND flash memory without the FTL. The proposed garbage collection method does not generate a rearrangement of the B+-Tree by using a block information table and a proxy block. We implemented the B+-Tree and μ -Tree with the proposed garbage collection on physical devices with the NAND flash memory. In experiment results, the proposed garbage collection scheme compared to greedy algorithm garbage collection scheme increased the number of inserted keys by up to about 73% on B+-Tree and decreased elapsed time of garbage collection by up to about 39% on μ-Tree.
-
[journal] Kwon, Se Jin / 2011 / FTL algorithms for NAND-type flash memories / Design Automation for Embedded Systems 15(3) : 191~224
[journal] Ma, Dongzhe / 2014 / A survey of address translation technologies for flash memories / ACMComputing Surveys (CSUR) 46(3) : 1~39
[journal] Fang, H. / 2014 / An Adaptive Endurance-Aware B⁺ -Tree for Flash Memory Storage Systems / Computers, IEEE Transactions 63(11) : 2661~2673
[confproc] Kang, Dongwon / 2007 / μ-Tree: an ordered index structure for NAND flash memory / Proceedings of the 7th ACM&IEEE international conference on Embedded software / ACM : 144~153
[journal] Ahn, Jung-Sang / 2013 / μ*-Tree: An Ordered Index Structure for NAND FlashMemory with Adaptive Page Layout Scheme / Computers, IEEE Transactions 62(4) : 784~797
[book] Na, Gap-Joo / 2009 / Database Systems for Advanced Applications / Springer : 755~758
[confproc] Na, Gap-Joo / 2009 / Dynamic in-page logging for flash-aware B⁺-tree index / Proceedings of the 18th ACM conference on Information and knowledge management / ACM : 1485~1488
[journal] Lee, Sungjin / 2014 / Improving Performance and Capacity of Flash Storage Devices by Exploiting Heterogeneity of MLC Flash Memory / Computers, IEEE Transactions 63(10) : 2445~2458
[confproc] H.-W. Fang / 2013 / MLC-Flash-Friendly logging and recovery for databases / Proc.ACM Symp. Appl. Comput. (SAC) : 1541~1546
[confproc] Li, Xiang / 2008 / A new dynamic hash index for flash-based storage / WAIM'08. The Ninth International Conference on. IEEE : 93~98
[journal] Chang, Yuan-Hao / 2010 / Improving flash wear-leveling by proactively moving static data / Computers, IEEE Transactions 59(1) : 53~65
[journal] Chung, Ching-Che / 2012 / A high-performance wear-leveling algorithm for flash memory system / IEICE Electronics Express 9(24) : 1874~1880
[web] / Hardware spec / http://docs.cubieboard.org/tutorials/cubietruck/start
[other] / Product Feature, H27UCG8T2ATR-BC Series 64Gb(8192M × 8bit) Legacy MLC NAND flash
[journal] Wu, Michael / 1994 / eNVy: a non-volatile, main memory storage system / ACM SigPlan Notices / ACM 29(11) : 86~97
-
89 Viewed
Print this page
Download PDF