A Process-Aware Hot/Cold Identification Scheme for Flash Memory Storage Systems
- Authors
- Jung, Sanghyuk; Lee, Yangsup; Song, Yong Ho
- Issue Date
- May-2010
- Publisher
- Institute of Electrical and Electronics Engineers
- Keywords
- NAND flash memory; buffer management; PID; Hot/cold identification
- Citation
- IEEE Transactions on Consumer Electronics, v.56, no.2, pp 339 - 347
- Pages
- 9
- Indexed
- SCI
SCIE
SCOPUS
- Journal Title
- IEEE Transactions on Consumer Electronics
- Volume
- 56
- Number
- 2
- Start Page
- 339
- End Page
- 347
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/175035
- DOI
- 10.1109/TCE.2010.5505937
- ISSN
- 0098-3063
1558-4127
- Abstract
- NAND flash memory has attractive features compared to hard disk drives such as small size, no mechanical noise and shock resistance. But it also has some drawbacks such as no support for in-place updates and limited program/erase cycles, which trigger the development of sophisticated buffer management algorithms in order to reduce write and/or erase operations to flash memory. The significant gap in update frequency between hot and cold data motivates us to separate hot and cold data on different flash blocks to avoid unnecessary program/erase cycles. Many buffer management algorithms determine a request to be hot or cold based on its requested data size. However, the data size could become a wrong indicator of update frequency in many applications. In this paper, we propose a new hot/cold identification scheme in order to increase identification accuracy and, thus, to enhance storage performance and durability by reducing program/erase cycles. The proposed technique uses the process identification used in many operating systems as a hot/cold indicator. The experimental results show that the proposed scheme contributes to high performance and durability as compared to previously proposed identification schemes(1).
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 융합전자공학부 > 1. Journal Articles

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.