A Self-Balancing Striping Scheme for NAND-Flash Storage Systems

檔案

本條目沒有附加檔案。

日期

2008

期刊名稱

APPLIED COMPUTING 2008, VOLS 1-3

卷期與頁次

頁 1715–1719

語言

英文

摘要

To use multiple memory banks in parallel is a nature approach to boost the performance of flash-memory storage systems. However, realistic data-access localities unevenly load each memory bank and thus the benefits of parallelism is severely limited. In this work, we propose to encode popular data with redundancy by means of erasure codes. Load balancing is thus achieved by accessing only lightly loaded banks, because to retrieve a subset of data blocks and code blocks sufficiently reconstructs the requested data. The technical issues pertain to redundancy allocation, redundancy placement, and request scheduling. By experiments, we found that, by offering 10% extra redundant space, the read response time is largely improved by 30%.

所屬典藏

會議論文
顯示完整詮釋資料 統計資料

引用此條目

Chang, Y.-B., & Chang, L.-P. (2008). A Self-Balancing Striping Scheme for NAND-Flash Storage Systems. APPLIED COMPUTING 2008, VOLS 1-3, 1715–1719. https://ir.lib.nycu.edu.tw/handle/11536/497

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/497