Garbage Collection Schemes of Flash Memory - Based Solid State Disk:\nComparison Between State of the Art

カテゴリ: 国際会議

論文No: MS6-4

グループ名: ACIS2015

発行日: 2015/10/15

著者名(英語): Ahmed I. Alsalibi (Unversiti Sains Malaysia),Putra Sumari(Unversiti Sains Malaysia), Ahmed A. Abusnaina(Unversiti Sains Malaysia)

キーワード: Solid State Disk, Garbage Collection,\nFlash Memory

要約(英語): Flash memory-based Solid State Disk (SSD) is a nonvolatile semiconductor memory which has several advantages over Hard Disk Drives (HDD) such as high energy efficiency, l ow access latency, less noise, reliability, no moving parts, lighter weight, small size and higher resilience to external shocks. However, the limited number of erase cycles for each storage unit (block) is considered one of SDD shortcomings. After certain cycles of erase operations, flash memory blocks become i nvalid. This physical limitation brings about the need for a new scheme to distribute the erase cycles evenly among all the blocks to prevent any block from worn before other blocks. This procedure is called Wear Leveling (WL). In this research, we compare the performance and reliability for some of leading schemes such as the Greedy (GR), Cost Benefit (CB), Cost Age Time (CAT), Kim & Lee scheme, and efficient g a rbage collection (FeGC). To demonstrate the efficiency of previous schemes, Eagle Tree simulator is used. The experimental results show that GR and Kim & Lee scheme performs better than the others in terms of number of erase operations, number of migration pages, average of write latency, and time taken during garbage collection.

原稿種別: 英語

PDFファイルサイズ: 2,379 Kバイト