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 language | English |
|---|---|
| Title of host publication | 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. |
| Pages | 174-183 |
| Number of pages | 10 |
| ISBN (Electronic) | 9781479989362 |
| DOIs | |
| Publication status | Published - 2015 Nov 23 |
| Event | 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 Duration: 2015 Aug 24 → 2015 Aug 26 |
Other
| Other | 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 |
|---|---|
| Country | United States |
| City | New York |
| Period | 15/8/24 → 15/8/26 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Software
- Control and Systems Engineering
- Computer Networks and Communications
Cite this
}
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 proceeding › Conference 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 -