Physically Addressed Queueing (PAQ)

Improving parallelism in solid state disks

Myoungsoo Jung, Ellis H. Wilson, Mahmut Kandemir

Research output: Chapter in Book/Report/Conference proceedingConference contribution

49 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publication2012 39th Annual International Symposium on Computer Architecture, ISCA 2012
Pages404-415
Number of pages12
DOIs
Publication statusPublished - 2012 Aug 15
Event2012 39th Annual International Symposium on Computer Architecture, ISCA 2012 - Portland, OR, United States
Duration: 2012 Jun 92012 Jun 13

Publication series

NameProceedings - International Symposium on Computer Architecture
ISSN (Print)1063-6897

Other

Other2012 39th Annual International Symposium on Computer Architecture, ISCA 2012
CountryUnited States
CityPortland, OR
Period12/6/912/6/13

Fingerprint

Physical addresses
Simulators
Bandwidth

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture

Cite this

Jung, M., Wilson, E. H., & Kandemir, M. (2012). Physically Addressed Queueing (PAQ): Improving parallelism in solid state disks. In 2012 39th Annual International Symposium on Computer Architecture, ISCA 2012 (pp. 404-415). [6237035] (Proceedings - International Symposium on Computer Architecture). https://doi.org/10.1109/ISCA.2012.6237035
Jung, Myoungsoo ; Wilson, Ellis H. ; Kandemir, Mahmut. / Physically Addressed Queueing (PAQ) : Improving parallelism in solid state disks. 2012 39th Annual International Symposium on Computer Architecture, ISCA 2012. 2012. pp. 404-415 (Proceedings - International Symposium on Computer Architecture).
@inproceedings{ee9783cc240c4b8b9918b6500c1ed605,
title = "Physically Addressed Queueing (PAQ): Improving parallelism in solid state disks",
abstract = "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.",
author = "Myoungsoo Jung and Wilson, {Ellis H.} and Mahmut Kandemir",
year = "2012",
month = "8",
day = "15",
doi = "10.1109/ISCA.2012.6237035",
language = "English",
isbn = "9781467304757",
series = "Proceedings - International Symposium on Computer Architecture",
pages = "404--415",
booktitle = "2012 39th Annual International Symposium on Computer Architecture, ISCA 2012",

}

Jung, M, Wilson, EH & Kandemir, M 2012, Physically Addressed Queueing (PAQ): Improving parallelism in solid state disks. in 2012 39th Annual International Symposium on Computer Architecture, ISCA 2012., 6237035, Proceedings - International Symposium on Computer Architecture, pp. 404-415, 2012 39th Annual International Symposium on Computer Architecture, ISCA 2012, Portland, OR, United States, 12/6/9. https://doi.org/10.1109/ISCA.2012.6237035

Physically Addressed Queueing (PAQ) : Improving parallelism in solid state disks. / Jung, Myoungsoo; Wilson, Ellis H.; Kandemir, Mahmut.

2012 39th Annual International Symposium on Computer Architecture, ISCA 2012. 2012. p. 404-415 6237035 (Proceedings - International Symposium on Computer Architecture).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Physically Addressed Queueing (PAQ)

T2 - Improving parallelism in solid state disks

AU - Jung, Myoungsoo

AU - Wilson, Ellis H.

AU - Kandemir, Mahmut

PY - 2012/8/15

Y1 - 2012/8/15

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84864842466&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84864842466&partnerID=8YFLogxK

U2 - 10.1109/ISCA.2012.6237035

DO - 10.1109/ISCA.2012.6237035

M3 - Conference contribution

SN - 9781467304757

T3 - Proceedings - International Symposium on Computer Architecture

SP - 404

EP - 415

BT - 2012 39th Annual International Symposium on Computer Architecture, ISCA 2012

ER -

Jung M, Wilson EH, Kandemir M. Physically Addressed Queueing (PAQ): Improving parallelism in solid state disks. In 2012 39th Annual International Symposium on Computer Architecture, ISCA 2012. 2012. p. 404-415. 6237035. (Proceedings - International Symposium on Computer Architecture). https://doi.org/10.1109/ISCA.2012.6237035