Low-overhead Proportional-share I/O Scheduler in Multi-queue Block Layer for NVMe SSDs
- 문서 유형
- 연구출판물 · 학술지 논문
- 등재
- KCISCIEScopus
- 저널 순위
- JCR Q4Scopus Q4
- 저널
- JOURNAL OF SEMICONDUCTOR TECHNOLOGY AND SCIENCE20(6) · pp.491 · 2020
- 피인용
- Web of Science 0Scopus 0KCI 0
- FWCI (Scopus)
- 0
- JCR IF
- JCR 2019 0.364
- ISSN
- 1598-1657
저자
초록
In the cloud computing where multiple isolated tenants share I/O resources, weight-based proportional I/O bandwidth sharing is a critical system requirement. However, existing I/O schedulers are not efficiently support proportional I/O bandwidth sharing for multi-queue storage device such as NVMe SSDs due to scalability problem. Especially, BFQ scheduler, default proportional I/O scheduler in Linux severely decreases the I/O performance of NVMe SSDs because of its serialized request dispatching process. In this paper, we present a low overhead proportional-share I/O scheduler for multi-queue block layer. The proposed I/O scheduler employs scalable request queue architecture and manages I/O bandwidth by distributing I/O tokens to multiple process groups(cgroups) in proportion to I/O weights. Moreover, the total amount of I/O tokens are dynamically adjusted to the fluctuated performance of NVMe SSDs due to internal operations of SSDs such as garbage collection and wear-leveling, so that the I/O performance of NVMe SSD is not wasted. Our I/O scheduler is implemented on Linux kernel 5.2.0 and evaluated with various benchmarks. The evaluation results show that our I/O scheduler improves I/O bandwidth 3.61 times than BFQ scheduler while sharing I/O bandwidth among multiple cgroups in proportion to I/O weights exactly. Also, our scheduler shows scalable performance close to Linux None scheduler even with extremely high degree of multiple threads.
키워드
NVMe SSDsproportional-share I/O schedulermulti-queue block layerLinuxCgroups
식별자
- Scopus EID
- 2-s2.0-85098917744
- WoS UID
- 000604276100002
- KCI
- ART002658838



로그인
연구물 목록으로