Contention-free fair queuing for high-speed storage with RAID-0 architecture

Myung Hyun Jo, Won Woo Ro

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

1 Citation (Scopus)

Abstract

Controlling the latency and throughput is a crucial part of designing an I/O scheduler that can provide guaranteed quality-of-service of a shared storage resource to multiple competing applications. Previously proposed I/O schedulers have mainly focused on ensuring proportional bandwidth allocation and a user-defined latency. However, the algorithms are not optimized for high-speed storage with restricted resources such as solid-state drives (SSD), because the storage performance can widely vary depending on the I/O patterns or the delays associated with different I/O operations as well as the I/O size. To solve these problems, we propose contention-free fair queuing (CFFQ) that accurately predicts the processing time of I/O requests considering the internal constraints of the storage, such as static striping and limited concurrency. Moreover, CFFQ compensates for the loss time of unselected I/O requests to ensure the bounded worst-case latency. In experiments, we have evaluated the guaranteed QoS of CFFQ versus the previous I/O scheduler (SFQ(D)) for diverse workloads. The experiments show that the throughput of CFFQ versus SFQ(D) is increased by up to 65% according to the workload while guaranteeing fairness and the worst-case latency.

Original languageEnglish
Title of host publicationProceedings - 2015 IEEE 17th International Conference on High Performance Computing and Communications, 2015 IEEE 7th International Symposium on Cyberspace Safety and Security and 2015 IEEE 12th International Conference on Embedded Software and Systems, HPCC-CSS-ICESS 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages174-183
Number of pages10
ISBN (Electronic)9781479989362
DOIs
Publication statusPublished - 2015 Nov 23
Event17th IEEE International Conference on High Performance Computing and Communications, IEEE 7th International Symposium on Cyberspace Safety and Security and IEEE 12th International Conference on Embedded Software and Systems, HPCC-ICESS-CSS 2015 - New York, United States
Duration: 2015 Aug 242015 Aug 26

Other

Other17th IEEE International Conference on High Performance Computing and Communications, IEEE 7th International Symposium on Cyberspace Safety and Security and IEEE 12th International Conference on Embedded Software and Systems, HPCC-ICESS-CSS 2015
CountryUnited States
CityNew York
Period15/8/2415/8/26

Fingerprint

Quality of service
Throughput
Frequency allocation
Experiments
Processing

All Science Journal Classification (ASJC) codes

  • Software
  • Control and Systems Engineering
  • Computer Networks and Communications

Cite this

Jo, M. H., & Ro, W. W. (2015). Contention-free fair queuing for high-speed storage with RAID-0 architecture. In Proceedings - 2015 IEEE 17th International Conference on High Performance Computing and Communications, 2015 IEEE 7th International Symposium on Cyberspace Safety and Security and 2015 IEEE 12th International Conference on Embedded Software and Systems, HPCC-CSS-ICESS 2015 (pp. 174-183). [7336161] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/HPCC-CSS-ICESS.2015.11
Jo, Myung Hyun ; Ro, Won Woo. / Contention-free fair queuing for high-speed storage with RAID-0 architecture. Proceedings - 2015 IEEE 17th International Conference on High Performance Computing and Communications, 2015 IEEE 7th International Symposium on Cyberspace Safety and Security and 2015 IEEE 12th International Conference on Embedded Software and Systems, HPCC-CSS-ICESS 2015. Institute of Electrical and Electronics Engineers Inc., 2015. pp. 174-183
@inproceedings{6687d0cd0c354f1bb5768bb4561b763d,
title = "Contention-free fair queuing for high-speed storage with RAID-0 architecture",
abstract = "Controlling the latency and throughput is a crucial part of designing an I/O scheduler that can provide guaranteed quality-of-service of a shared storage resource to multiple competing applications. Previously proposed I/O schedulers have mainly focused on ensuring proportional bandwidth allocation and a user-defined latency. However, the algorithms are not optimized for high-speed storage with restricted resources such as solid-state drives (SSD), because the storage performance can widely vary depending on the I/O patterns or the delays associated with different I/O operations as well as the I/O size. To solve these problems, we propose contention-free fair queuing (CFFQ) that accurately predicts the processing time of I/O requests considering the internal constraints of the storage, such as static striping and limited concurrency. Moreover, CFFQ compensates for the loss time of unselected I/O requests to ensure the bounded worst-case latency. In experiments, we have evaluated the guaranteed QoS of CFFQ versus the previous I/O scheduler (SFQ(D)) for diverse workloads. The experiments show that the throughput of CFFQ versus SFQ(D) is increased by up to 65{\%} according to the workload while guaranteeing fairness and the worst-case latency.",
author = "Jo, {Myung Hyun} and Ro, {Won Woo}",
year = "2015",
month = "11",
day = "23",
doi = "10.1109/HPCC-CSS-ICESS.2015.11",
language = "English",
pages = "174--183",
booktitle = "Proceedings - 2015 IEEE 17th International Conference on High Performance Computing and Communications, 2015 IEEE 7th International Symposium on Cyberspace Safety and Security and 2015 IEEE 12th International Conference on Embedded Software and Systems, HPCC-CSS-ICESS 2015",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

Jo, MH & Ro, WW 2015, Contention-free fair queuing for high-speed storage with RAID-0 architecture. in Proceedings - 2015 IEEE 17th International Conference on High Performance Computing and Communications, 2015 IEEE 7th International Symposium on Cyberspace Safety and Security and 2015 IEEE 12th International Conference on Embedded Software and Systems, HPCC-CSS-ICESS 2015., 7336161, Institute of Electrical and Electronics Engineers Inc., pp. 174-183, 17th IEEE International Conference on High Performance Computing and Communications, IEEE 7th International Symposium on Cyberspace Safety and Security and IEEE 12th International Conference on Embedded Software and Systems, HPCC-ICESS-CSS 2015, New York, United States, 15/8/24. https://doi.org/10.1109/HPCC-CSS-ICESS.2015.11

Contention-free fair queuing for high-speed storage with RAID-0 architecture. / Jo, Myung Hyun; Ro, Won Woo.

Proceedings - 2015 IEEE 17th International Conference on High Performance Computing and Communications, 2015 IEEE 7th International Symposium on Cyberspace Safety and Security and 2015 IEEE 12th International Conference on Embedded Software and Systems, HPCC-CSS-ICESS 2015. Institute of Electrical and Electronics Engineers Inc., 2015. p. 174-183 7336161.

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

TY - GEN

T1 - Contention-free fair queuing for high-speed storage with RAID-0 architecture

AU - Jo, Myung Hyun

AU - Ro, Won Woo

PY - 2015/11/23

Y1 - 2015/11/23

N2 - Controlling the latency and throughput is a crucial part of designing an I/O scheduler that can provide guaranteed quality-of-service of a shared storage resource to multiple competing applications. Previously proposed I/O schedulers have mainly focused on ensuring proportional bandwidth allocation and a user-defined latency. However, the algorithms are not optimized for high-speed storage with restricted resources such as solid-state drives (SSD), because the storage performance can widely vary depending on the I/O patterns or the delays associated with different I/O operations as well as the I/O size. To solve these problems, we propose contention-free fair queuing (CFFQ) that accurately predicts the processing time of I/O requests considering the internal constraints of the storage, such as static striping and limited concurrency. Moreover, CFFQ compensates for the loss time of unselected I/O requests to ensure the bounded worst-case latency. In experiments, we have evaluated the guaranteed QoS of CFFQ versus the previous I/O scheduler (SFQ(D)) for diverse workloads. The experiments show that the throughput of CFFQ versus SFQ(D) is increased by up to 65% according to the workload while guaranteeing fairness and the worst-case latency.

AB - Controlling the latency and throughput is a crucial part of designing an I/O scheduler that can provide guaranteed quality-of-service of a shared storage resource to multiple competing applications. Previously proposed I/O schedulers have mainly focused on ensuring proportional bandwidth allocation and a user-defined latency. However, the algorithms are not optimized for high-speed storage with restricted resources such as solid-state drives (SSD), because the storage performance can widely vary depending on the I/O patterns or the delays associated with different I/O operations as well as the I/O size. To solve these problems, we propose contention-free fair queuing (CFFQ) that accurately predicts the processing time of I/O requests considering the internal constraints of the storage, such as static striping and limited concurrency. Moreover, CFFQ compensates for the loss time of unselected I/O requests to ensure the bounded worst-case latency. In experiments, we have evaluated the guaranteed QoS of CFFQ versus the previous I/O scheduler (SFQ(D)) for diverse workloads. The experiments show that the throughput of CFFQ versus SFQ(D) is increased by up to 65% according to the workload while guaranteeing fairness and the worst-case latency.

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

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

U2 - 10.1109/HPCC-CSS-ICESS.2015.11

DO - 10.1109/HPCC-CSS-ICESS.2015.11

M3 - Conference contribution

SP - 174

EP - 183

BT - Proceedings - 2015 IEEE 17th International Conference on High Performance Computing and Communications, 2015 IEEE 7th International Symposium on Cyberspace Safety and Security and 2015 IEEE 12th International Conference on Embedded Software and Systems, HPCC-CSS-ICESS 2015

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Jo MH, Ro WW. Contention-free fair queuing for high-speed storage with RAID-0 architecture. In Proceedings - 2015 IEEE 17th International Conference on High Performance Computing and Communications, 2015 IEEE 7th International Symposium on Cyberspace Safety and Security and 2015 IEEE 12th International Conference on Embedded Software and Systems, HPCC-CSS-ICESS 2015. Institute of Electrical and Electronics Engineers Inc. 2015. p. 174-183. 7336161 https://doi.org/10.1109/HPCC-CSS-ICESS.2015.11