낸드 플래시 메모리 기반의 지속성을 고려한 hot data identification 기법
Hot Data Identification For Flash Based Storage Systems Considering Continuous Write Operation
2
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
Recently, NAND flash memory, which is used as a storage medium, is replacing HDD (Hard Disk Drive) at a high speed due to various advantages such as fast access speed, low power, and easy portability. In order to apply NAND flash memory to a computer system, a Flash Translation Layer (FTL) is indispensably required. FTL provides a number of features such as address mapping, garbage collection, wear leveling, and hot data identification. In particular, hot data identification is an algorithm that identifies specific pages where data updates frequently occur. Hot data identification helps to improve overall performance by identifying and managing hot data separately. MHF (Multi hash framework) technique, known as hot data identification technique, records the number of write operations in memory. The recorded value is evaluated and judged as hot data. However, the method of counting the number of times in a write request is not enough to judge a page as a hot data page. In this paper, we propose hot data identification which considers not only the number of write requests but also the persistence of write requests.
Abstract
Recently, NAND flash memory, which is used as a storage medium, is replacing HDD (Hard Disk Drive) at a high speed due to various advantages such as fast access speed, low power, and easy portability. In order to apply NAND flash memory to a computer system, a Flash Translation Layer (FTL) is indispensably required. FTL provides a number of features such as address mapping, garbage collection, wear leveling, and hot data identification. In particular, hot data identification is an algorithm that identifies specific pages where data updates frequently occur. Hot data identification helps to improve overall performance by identifying and managing hot data separately. MHF (Multi hash framework) technique, known as hot data identification technique, records the number of write operations in memory. The recorded value is evaluated and judged as hot data. However, the method of counting the number of times in a write request is not enough to judge a page as a hot data page. In this paper, we propose hot data identification which considers not only the number of write requests but also the persistence of write requests.
참고문헌 (9)
- Tae-Sun Chung, "System Software for Flash Memory: A Survey" (2004)
- Jun Liu, "A Novel Hot Data Identification Mechanism for NAND Flash Memory", IEEE Journals & Magazines, 61(Issue:4), pp.463~469 (2015)
- Jen-Wei Hsieh, "Efficient identification of hot data for flash memory storage systems", ACM Transactions on Storage (TOS), 2(Issue 1) (2006)
- Hyun-Seob Lee, "HFTL:Hybrid Flash Translation Layer based on Hot Data Identification for Flach Memory", IEEE Journals &Magazines (2009)
- Dongchul Park, "Hot data identification for flash-based storage systems using multiple bloom filters", 2011 IEEE 27th Symposium on Mass Storage Systems and Technologies (MSST) (2011)
- L. -P. Chang, "On efficient wear-leveling for largescale flash-memory storage systems", Proc. of the 2007 ACM symposium on Applied computing, pp.1126~1130 (2007)
- Y.-H. Chang, "Improving flash wear-leveling by proactively moving static data", IEEE Transactions on Computers, 59(1), pp.53~65 (2010)
- Sanghyuk Jung, "A process-aware hot", cold identification scheme for flash memory storage systems, 2010, pp.56(Issue: 2), 339~347
- Kyuwoon Kim, "Compression ratio based hot", cold data identification for flash memory, 2011, 33~34