Multi-core Scalable Fair I/O Scheduling for Multi-queue SSDs 


Vol. 44,  No. 5, pp. 469-475, May  2017


PDF

  Abstract

The emerging NVMe-based multi-queue SSDs provides a high bandwidth by parallel I/O, i.e., each core performs I/O through its dedicated queue in parallel with other cores. To provide a bandwidth share for each application with I/O, a fair-share scheduler that provides a bandwidth share to each core is required. In this study, we proposed a multi-core scalable fair-queuing algorithm for multi-queue SSDs. The algorithm adopts randomization to minimize the inter-core synchronization overheads and provides a weight-proportional bandwidth share to each core. The results of our experiments indicated that the proposed algorithm gives accurate bandwidth partitioning and outperforms the existing FlashFQ scheduler, regardless of the number of cores for a Linux kernel with block-mq.


  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

M. Cho, H. Kang, K. Kim, "Multi-core Scalable Fair I/O Scheduling for Multi-queue SSDs," Journal of KIISE, JOK, vol. 44, no. 5, pp. 469-475, 2017. DOI: .


[ACM Style]

Minjung Cho, Hyeongseok Kang, and Kanghee Kim. 2017. Multi-core Scalable Fair I/O Scheduling for Multi-queue SSDs. Journal of KIISE, JOK, 44, 5, (2017), 469-475. DOI: .


[KCI Style]

조민정, 강형석, 김강희, "멀티큐 SSD를 위해 멀티코어 확장성을 제공하는 공정한 입출력 스케줄링," 한국정보과학회 논문지, 제44권, 제5호, 469~475쪽, 2017. DOI: .


[Endnote/Zotero/Mendeley (RIS)]  Download


[BibTeX]  Download



Search




Journal of KIISE

  • ISSN : 2383-630X(Print)
  • ISSN : 2383-6296(Electronic)
  • KCI Accredited Journal

Editorial Office

  • Tel. +82-2-588-9240
  • Fax. +82-2-521-1352
  • E-mail. chwoo@kiise.or.kr