Interleaving read and write requests to reduce latency and maximize throughput in a flash storage device

作者: Murali Krishna Vishnumolakala , Anil Kumar Nanduri

DOI:

关键词:

摘要: In an all-flash storage array, write requests can take about 9 to 10 times longer than a read request of the same size. There could be several problems when reading or writing from storage, such as large slowing down small requests, other requests. Also, may slow smaller by filling incoming queue. one implementation, determination is made on what maximum size flash that improves throughput chip (e.g., beyond certain do not improve throughput). A chunklet defined block data having calculated As come in, are broken into chunklets, and then chunklets queued for processing chip. One processed at time per request. This way, does monopolize use period time, allowing while being storage.

参考文章(9)
Vered Kelner, Nicholas Thomas, Barry Wright, Joseph Meza, Judah Gamliel Hahn, System and Method for I/O Optimization in a Multi-Queued Environment ,(2014)
Michele M. Franceschini, Blake G. Fitch, Bernaard Metzler, Lars Schneidenbach, Local direct storage class memory access ,(2013)
Pamela Hempstead, Randy Reiter, Michael Hicken, Timothy Swatosh, Startup reconstruction of logical-to-physical address translation data for solid state disks ,(2010)
Vineeth Remanan Pillai, Alexander Aizman, Method and system for heterogeneous data volume ,(2011)
Roland Paterson-Jones, Tate Andrew Certain, James R. Hamilton, Balancing latency and throughput for shared resources ,(2012)
Gary A. Tressler, Janani Swaminathan, Prasanna Jayaraman, Abhijit Saurabh, M. Dean Sciacca, Transfer size monitor, determination, and optimization engine for storage devices ,(2014)
Hari Kannan, Zhangxi Tan, Nenad Miladinovic, John Hayes, John D. Davis, Data rebuild on feedback from a queue in a non-volatile solid-state storage ,(2014)