An Interference Fair Queueing I/O Scheduler under High Performance Processors

被引：0

作者：

Sui Y. ^{[1
]}

Ye J. ^{[1
]}

Yang C. ^{[1
]}

Tong D. ^{[1
]}

机构：

[1] School of Electronics Engineering and Computer Science, Peking University, Beijing

来源：

Beijing Daxue Xuebao (Ziran Kexue Ban)/Acta Scientiarum Naturalium Universitatis Pekinensis | 2020年 / 56卷 / 06期

关键词：

Interence fairness; Solid-state disks; Storage scheduler;

D O I：

10.13209/j.0479-8023.2020.100

中图分类号：

学科分类号：

摘要：

High performance processors and systems require high storage bandwidth and efficient external I/O processing. Many systems using high performance processors server a mixture of fully backlogged users, which continuously demand resources, and non-fully backlogged users. This presents challenges for fair resource management in multi-programmed computer systems and multi-tenant super computer systems. This paper develops a new storage I/O scheduler IFQ (interference fair queueing) for parallel accessible devices, such as SSDs. IFQ is implemented in Linux and compared with several existing I/O schedulers-Linux CFQ, STF, MFAP scheduler and MFAP scheduler with short time-slices. Results on synthetic I/O benchmarks, trace benchmarks, and real-world benchmarks demonstrate that only IFQ can achieve both fairness and high responsiveness. © 2020 Peking University.

引用

页码：1005 / 1012

页数：7

共 25 条

[1]

Mao H, Schwarzkopf M, Venkatakrishnan S B, Et al., Learning scheduling algorithms for data processing clusters, Proceedings of the ACM Special Interest Group on Data Communication, pp. 270-288, (2019)

[2]

Mitra S, Mondal S S, Sheoran N, Et al., DeepPlace: learning to place applications in multi-tenant clusters, Proceedings of the 10th ACM SIGOPS Asia-Pacific Workshop on Systems, pp. 61-68, (2019)

[3]

Zhang G, Lu R, Wu W., Multi-resource fair allocation for cloud federation, 2019 IEEE 21st International Conference on High Performance Computing and Com-munications, pp. 2189-2194, (2019)

[4]

[5]

Caprita B, Chan W C, Nieh J, Et al., Group ratio round-robin: O(1) proportional share scheduling for uniprocessor and multiprocessor systems, USENIX Annual Technical Conference, pp. 337-352, (2005)

[6]

Agrawala A K, Bryant R M., Models of memory sche-duling, ACM SIGOPS Operating Systems Review, 9, 5, pp. 217-222, (1975)

[7]

Demers A, Keshav S, Shenker S., Analysis and simu-lation of a fair queueing algorithm, ACM SIGCOMM Computer Communication Review, 19, 4, pp. 1-12, (1989)

[8]

[9]

Wong T M, Golding R A, Lin C, Et al., Zygaria: storage performance as a managed resource, 12th IEEE Real-Time and Embedded Technology and Applications Symposium, pp. 125-134, (2006)

[10]

Ghodsi A, Zaharia M, Hindman B, Et al., Dominant resource fairness: fair allocation of multiple resource types, Proceedings of the 8th USENIX conference on Networked systems design and implementation, pp. 323-336, (2011)

← 1 2 3 →