실시간 시스템에서의 플래시 메모리 저장 장치를 위한 적응적 가비지 컬렉션 정책
A Adaptive Garbage Collection Policy for Flash-Memory Storage System in Embedded Systems
2
조회
0
다운로드
2
인용
0
참고문헌
키워드
초록
NAND flash memory has advantages of non-volatility, little power consumption and fast access time. However, it suffers from inability that does not provide to update-in-place and the erase cycle is limited. Moreover, the unit of read/write operation is a page and the unit of erase operation is a block. Therefore, erase operation is slower than other operations. The AGC, the proposed garbage collection policy focuses on not only garbage collection time reduction for real-time guarantee but also wear-leveling for a flash memory lifetime. In order to achieve above goals, we define three garbage collection operating modes: Fast Mode, Smart Mode, and Wear-leveling Mode. The proposed policy decides the garbage collection mode depending on system CPU usage rate. Fast Mode selects the dirtiest block as victim block to minimize the erase operation time. However, Smart Mode selects the victim block by reflecting the invalid page number and block erase count to minimizing the erase operation time and deviation of block erase count. Wear-leveling Mode operates similar to Smart Mode and it makes groups and relocates the pages which has the similar update time. We implemented the proposed policy and measured the performance compare with the existing policies. Simulation results show that the proposed policy performs better than Cost-benefit policy with the 55% reduction in the operation time. Also, it performs better than Greedy policy with the 87% reduction in the deviation of erase count. Most of all, the proposed policy works adaptively according to the CPU usage rate, and guarantees the real-time performance of the system.
Abstract
NAND flash memory has advantages of non-volatility, little power consumption and fast access time. However, it suffers from inability that does not provide to update-in-place and the erase cycle is limited. Moreover, the unit of read/write operation is a page and the unit of erase operation is a block. Therefore, erase operation is slower than other operations. The AGC, the proposed garbage collection policy focuses on not only garbage collection time reduction for real-time guarantee but also wear-leveling for a flash memory lifetime. In order to achieve above goals, we define three garbage collection operating modes: Fast Mode, Smart Mode, and Wear-leveling Mode. The proposed policy decides the garbage collection mode depending on system CPU usage rate. Fast Mode selects the dirtiest block as victim block to minimize the erase operation time. However, Smart Mode selects the victim block by reflecting the invalid page number and block erase count to minimizing the erase operation time and deviation of block erase count. Wear-leveling Mode operates similar to Smart Mode and it makes groups and relocates the pages which has the similar update time. We implemented the proposed policy and measured the performance compare with the existing policies. Simulation results show that the proposed policy performs better than Cost-benefit policy with the 55% reduction in the operation time. Also, it performs better than Greedy policy with the 87% reduction in the deviation of erase count. Most of all, the proposed policy works adaptively according to the CPU usage rate, and guarantees the real-time performance of the system.
참고문헌 (10)
- F. Douglis, "Storage Alternative for Mobile Computers", Proceedings of the 1st USENIX Symposium on Operating System Design and Implementation, pp.25~37 (1994)
- M. L. Chiang, "Managing Flash Memory in Personal Communication Devices", Proceedings of IEEE Symposium on Consumer Electronics, pp.177~182 (1997)
- M. L. Chiang, "Cleaning Policies in Mobile Computers Using Flash Memory", Journal of System and Software, 48(3), pp.213~231 (1999)
- A. Kawaguchi, "A Flash-Memory Based File System", Proceedings of 1995 USENIX Technical Conference, pp.155~164 (1995)
- O. Kwon, "Swap-aware Garbage Collection for NAND Flash Memory Based Embedded Systems", Proceedings of IEEE 7th International Conference on Computer and Information Technology, pp.787~292 (2007)
- 백승재, "블록 클리닝 비용 분석에 기초한 MODA할당 정책 설계 및 구현", 정보과학회논문지 : 시스템 및 이론, 34(11), pp.599~609 (2007), 한국정보과학회
- 황상호, "낸드 플래시 메모리의 이주 오버헤드 감소 및 수명연장을 위한 가비지 컬렉션 기법", 대한임베디드공학회논문지, 11(2), pp.125~134 (2016), 대한임베디드공학회[DOI]
- 김선환, "플래시 메모리 기반 인덱스 구조에서 대리블록 이용한 가비지 컬렉션 기법", 한국컴퓨터정보학회논문지, 20(6), pp.1~11 (2015), 한국컴퓨터정보학회
- V. Prabhakaran, "SSD Extension for DiskSim Simulation Environment", Microsoft Research 2009 (2009)
- "K9GAG08U0M 2G x 8bit MLC NAND Flash Memory Data Sheet, Samsung Electronics" (2007)[URL]
