File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

노삼혁

Noh, Sam H.
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Space-efficient flash translation layer for CompactFlash systems

Author(s)
Kim, JesungKim, Jong MinNoh, Sam H.Min, Sang LyulCho, Yookun
Issued Date
2002-05
DOI
10.1109/TCE.2002.1010143
URI
https://scholarworks.unist.ac.kr/handle/201301/17387
Fulltext
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=1010143
Citation
IEEE TRANSACTIONS ON CONSUMER ELECTRONICS, v.48, no.2, pp.366 - 375
Abstract
Flash memory is becoming increasingly important as nonvolatile storage for mobile consumer electronics due to its low power consumption and shock resistance. However, it imposes technical challenges in that a write should be preceded by an erase operation, and that this erase operation can be performed only in a unit much larger than the write unit. To address these technical hurdles, an intermediate software layer called a flash translation layer (FTL) is generally employed to redirect logical addresses from the host system to physical addresses in flash memory. Previous approaches have performed this address translation at the granularity of either a write unit (page) or an erase unit (block). In this paper, we propose a novel FTL design that combines the two different granularities in address translation. This is motivated by the idea that coarse grain address translation lowers resources required to maintain translation information, which is crucial in mobile consumer products for cost and power consumption reasons, while fine grain address translation is efficient in handling small size writes. Performance evaluation based on trace-driven simulation shows that the proposed scheme significantly outperforms previously proposed approaches.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
ISSN
0098-3063

qrcode

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