JOURNAL BROWSE
Search
Advanced SearchSearch Tips
Garbage Collection Method using Proxy Block considering Index Data Structure based on Flash Memory
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Garbage Collection Method using Proxy Block considering Index Data Structure based on Flash Memory
Kim, Seon Hwan; Kwak, Jong Wook;
  PDF(new window)
 Abstract
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.
 Keywords
Flash memory;B+-Tree;Garbage collection;Storage system;Index data structure;
 Language
Korean
 Cited by
1.
An MCFQ I/O Scheduler Considering Virtual Machine Bandwidth Distribution,;

한국컴퓨터정보학회논문지, 2015. vol.20. 10, pp.91-97 crossref(new window)
2.
Wear Leveling Technique using Bit Array and Bit Set Threshold for Flash Memory,;;;

한국컴퓨터정보학회논문지, 2015. vol.20. 11, pp.1-8 crossref(new window)
 References
1.
Kwon, Se Jin, et al. "FTL algorithms for NAND-type flash memories." Design Automation for Embedded Systems, Vol. 15. No. 3-4, pp. 191-224, Dec. 2011. crossref(new window)

2.
'Ma, Dongzhe, Jianhua Feng, and Guoliang Li. "A survey of address translation technologies for flash memories." ACMComputing Surveys (CSUR), Vol. 46, No. 3, pp. 1-39, Jan. 2014.

3.
Fang, H., et al. "An Adaptive Endurance-Aware $B^+$ -Tree for Flash Memory Storage Systems." Computers, IEEE Transactions, Vol. 63, No. 11, pp. 2661-2673, Nov. 2014. crossref(new window)

4.
Kang, Dongwon, et al. "${\mu}$-Tree: an ordered index structure for NAND flash memory." Proceedings of the 7th ACM&IEEE international conference on Embedded software. ACM, pp. 144-153, Sep. 2007.

5.
Ahn, Jung-Sang, et al. "${\mu}^*$-Tree: An Ordered Index Structure for NAND FlashMemory with Adaptive Page Layout Scheme." Computers, IEEE Transactions, Vol. 62, No. 4, pp. 784-797, Apr. 2013. crossref(new window)

6.
Na, Gap-Joo, Bongki Moon, and Sang-Won Lee. "In-page logging $B^+$-tree for flash memory." Database Systems for Advanced Applications. Springer BerlinHeidelberg, pp. 755-758, Apr. 2009.

7.
Na, Gap-Joo, Sang-Won Lee, and Bongki Moon. "Dynamic in-page logging for flash-aware $B^+$-tree index." Proceedings of the 18th ACM conference on Information and knowledge management. ACM, pp. 1485-1488, Nov. 2009.

8.
Lee, Sungjin, and Jihong Kim. "Improving Performance and Capacity of Flash Storage Devices by Exploiting Heterogeneity of MLC Flash Memory." Computers, IEEE Transactions, Vol. 63, No. 10, pp. 2445-2458, Oct. 2014. crossref(new window)

9.
H.-W. Fang, M.-Y. Yeh, and T.-W. Kuo, "MLC-Flash-Friendly logging and recovery for databases." in Proc.ACM Symp. Appl. Comput. (SAC), pp. 1541-1546, Mar. 2013.

10.
Li, Xiang, Zhou Da, and Xiaofeng Meng. "A new dynamic hash index for flash-based storage." WAIM'08. The Ninth International Conference on. IEEE, pp. 93-98, Jul. 2008.

11.
Chang, Yuan-Hao, Jen-Wei Hsieh, and Tei-Wei Kuo. "Improving flash wear-leveling by proactively moving static data." Computers, IEEE Transactions, Vol. 59, No. 1, pp. 53-65, Jan. 2010. crossref(new window)

12.
Chung, Ching-Che, Duo Sheng, and Ning-Mi Hsueh. "A high-performance wear-leveling algorithm for flash memory system." IEICE Electronics Express, Vol. 9, No. 24, pp. 1874-1880, Dec. 2012. crossref(new window)

13.
Hardware spec, http://docs.cubieboard.org/tutorials/cubietruck/start.

14.
Product Feature, H27UCG8T2ATR-BC Series 64Gb(8192M $\times$ 8bit) Legacy MLC NAND flash.

15.
Wu, Michael, and Willy Zwaenepoel. "eNVy: a non-volatile, main memory storage system." ACM SigPlan Notices. ACM, Vol. 29, No. 11, pp. 86-97, Nov. 1994. crossref(new window)