Physically Addressed Queueing (PAQ): Improving parallelism in solid state disks

Cited 0 time in webofscience Cited 74 time in scopus
  • Hit : 164
  • Download : 0
NAND flash storage has proven to be a competitive alternative to traditional disk for its properties of high random-access speeds, low-power and its presumed efficacy for random-reads. Ironically, we demonstrate that when packaged in SSD format, there arise many barriers to reaching full parallelism in reads, resulting in random writes outperforming them. Motivated by this, we propose Physically Addressed Queuing (PAQ), a request scheduler that avoids resource contention resultant from shared SSD resources. PAQ makes the following major contributions: First, it exposes the physical addresses of requests to the scheduler. Second, I/O clumping is utilized to select groups of operations that can be simultaneously executed without major resource conflict. Third, inter-request NAND transaction packing empowers multi-plane-mode operations. We implement PAQ in a cycle-accurate simulator and demonstrate bandwidth and IOPS improvements greater than 62% and latency decreases as much as 41.6% for random reads, without degrading performance of other access types. © 2012 IEEE.
Publisher
ACM SIGGRAPH and IEEE TCCA
Issue Date
2012-06-09
Language
English
Citation

2012 39th Annual International Symposium on Computer Architecture, ISCA 2012, pp.404 - 415

DOI
10.1109/ISCA.2012.6237035
URI
http://hdl.handle.net/10203/269701
Appears in Collection
EE-Conference Papers(학술회의논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0