An I/O Scheduling Strategy for Embedded Flash Storage Devices With Mapping Cache

檔案

本條目沒有附加檔案。

至出版者網站查看(DOI) ›

日期

2018-04-01

類型

期刊名稱

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS

卷期與頁次

第 37 卷,頁 756–769

ISSN

0278-0070

語言

英文

摘要

NAND flash memory has been the default storage component in embedded systems. One of the key technologies for flash management is the address mapping scheme between logical addresses and physical addresses, which deals with the inability of in-place-updating in flash memory. Demand-based page-level mapping cache is often applied to match the cache size constraint and performance requirement of embedded storage systems. However, recent studies showed that the management overhead of mapping cache schemes is sensitive to the host I/O patterns, especially when the mapping cache is small. This paper presents a novel I/O scheduling scheme, called MAP+, to alleviate this problem. The proposed scheduling approach reorders I/O requests for performance improvement from two angles. Prioritizing the requests that will hit in the mapping cache, and grouping requests with related logical addresses into large batches. Batches of requests are reordered to further optimize request waiting time. Experimental results show that MAP+ improved upon traditional I/O schedulers by 48% and 18% in terms of read and write latencies, respectively.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Ji, C., Chang, L.-P., Wu, C., Shi, L., & Xue, C. J. (2018). An I/O Scheduling Strategy for Embedded Flash Storage Devices With Mapping Cache. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 37, 756–769. https://doi.org/10.1109/TCAD.2017.2729405

BibTeX RIS

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

分享

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