상세 보기
마모도 평준화를 위한 File Clustering 알고리즘
- 이태화;
- 차재혁
초록
Storage device based on Flash Memory have many attractive features such as high performance, low power consumption, shock resistance, and low weight, so they replace HDDs to a certain extent. An Storage device based on Flash Memory has FTL(Flash Translation Layer) which emulate block storage devices like HDDs. A garbage collection, one of major functions of FTL, effects highly on the performance and the lifetime of devices. However, there is no de facto standard for new garbage collection algorithms. To solve this problem, we propose File Clustering Algorithm. File Clustering Algorithm respect to update page from same file at the same time. So, these are clustered to same block. For this mechanism, We propose Page Allocation Policy in FTL and use MIN-MAX GAP to guarantee wear leveling. To verify the algorithm in this paper, we use TPC Benchmark. So, The performance evaluation reveals that the proposed algorithm has comparable result with the existing algorithms(No wear leveling, Hot/Cold) and shows approximately 690% improvement in terms of the wear leveling.
키워드
- 제목
- 마모도 평준화를 위한 File Clustering 알고리즘
- 제목 (타언어)
- A File Clustering Algorithm for Wear-leveling
- 저자
- 이태화; 차재혁
- 발행일
- 2013-03
- 저널명
- 디지털컨텐츠학회논문지
- 권
- 14
- 호
- 1
- 페이지
- 51 ~ 57