標題: | 一種應用於NAND 型快閃記憶體之基於抹除碼的平行化技術 An Erasure-code-based Striping Scheme for NAND-Flash Storage System |
作者: | 張譽繽 Yu-Bin Chang 張立平 Li-Pin Chang 網路工程研究所 |
關鍵字: | 快閃記憶體;儲存系統;入式系統;作業系統;Flash memory;storage systems;embedded systems;operating systems |
公開日期: | 2007 |
摘要: | 在一塊大塊的快閃記憶體中,使用多重小塊的快閃記憶體(bank)做平行化存取,主要是用來提高系統存取時的效能,此種做法已經很普遍了,然而,現實環境中的資料存取,將使得各個bank 間存取工作量的不平均,如此導致平行化存取產生的效能被限制住,在這篇研究中,我們將比較常存取的資料作編碼成另一份資料,這類資料也就是消除碼(erasure codes),因為消除碼只要與部份的原始資料一起做解碼後,即可回復原本的資料,而一份要求中含很多的小型工作,研究的目的是希望能將小型工作從工作量重的bank 中,藉由其餘工作量輕的bank 中的消除碼取代,如此達到bank間工作量的平衡,研究中主要討論分成(1)如何製作與分派消除碼(2)如何放置消除碼於bank 中(3)消除碼分派與放置完後,一份要求來後該如何的做排班。由實驗結果,我們發現只要提供10%的額外空間作消除碼,即可使得
讀取的動作提高了50%的效能。 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 50%. |
URI: | http://140.113.39.130/cdrfb3/record/nctu/#GT009456558 http://hdl.handle.net/11536/82216 |
Appears in Collections: | Thesis |
Files in This Item:
If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.