Efficient transitory co-scheduling for MP virtual machines

Abstract
Figures/Tables
References
Related Articles
Metrics

Download: PDF(1600 KB) HTML
Export: BibTeX | EndNote | Reference Manager | ProCite | RefWorks

Abstract

Multiprocessor (MP) virtual machines (VMs) are widely used in cloud environments with the development of MP hardware and the demands for greater computing power. However, MP VMs suffer from the lock holder preemption (LHP) issue, which causes significant system performance degradation. This paper describes an efficient transitory co-scheduling algorithm based on the Linux CFS scheduler that effectively bypasses the guest spin lock loop to achieve better system performance. Tests show that this method significantly improves system performance (up to 3.41 fold performance advantage over the original Linux kernel 2.6.38 with SysBench.OLTP 4-VM case), while at the same time improving system latency with little to no effect on scheduling fairness.

Keywords virtual machine scheduling multicore lock holder preemption

Issue Date: 15 April 2014

	Service

	E-mail this article
	E-mail Alert
	RSS
	Articles by authors

	Lei ZHANG
	Zhijiao ZHANG
	Yu CHEN

Cite this article:

Lei ZHANG,Zhijiao ZHANG,Yu CHEN. Efficient transitory co-scheduling for MP virtual machines[J]. Journal of Tsinghua University(Science and Technology), 2014, 54(4): 495-501.

URL:

http://jst.tsinghuajournals.com/EN/ OR http://jst.tsinghuajournals.com/EN/Y2014/V54/I4/495

[1]	Karlin A, Li K, Manasse M, et al.Empirical studies of competitive spinning for a shared-memory multiprocessor [J]. ACM SIGOPS Operating Systems Review, 1991, 25(5): 41-55. url: http://dx.doi.org/10.1145/121133.286599
[2]	Zahorjan J, Lazowska D, Eager D. The effect of scheduling discipline on spin overhead in shared memory parallel Systems[J].IEEE Transactions on Parallel and Distributed Systems, 1991, 2(2): 180-198. url: http://dx.doi.org/10.1109/71.89064
[3]	Ousterhout J. Scheduling techniques for concurrent systems [C]// Proceedings of the 3rd International Conference on Distributed Computing Systems. Florida, USA: IEEE, 1982: 22-30.
[4]	Strazdins P, Uhlmann J. A comparison of local and gang scheduling on a beowulf cluster [C]// Proceedings of the 2004 IEEE International Conference on Cluster Computing. Washington, DC: IEEE, 2004: 55-72.
[5]	Feitelson D G, Rudolph L. Gang scheduling performance benefits for fine-grain synchronization[J]. Journal of Parallel and Distributed Computing, 1992, 16(4): 306-318. url: http://dx.doi.org/10.1016/0743-7315(92)90014-E
[6]	Wiseman Y, Feitelson D. Paired gang scheduling[J]. IEEE Transactions on Parallel and Distributed Systems, 2003, 14(6): 581-592. url: http://dx.doi.org/10.1109/TPDS.2003.1206505
[7]	Lee W, Frank M, Lee V, et al.Implications of I/O for gang scheduled workloads [C]// Job Scheduling Strategies for Parallel Processing. Berlin Heidelberg: Springer, 1997: 215-237.
[8]	Uhlig V, Levasseur J, Skoglund E, et al.Towards scalable multiprocessor virtual machines [C]// Virtual Machine Research and Technology Symposium. San Jose, California: USENIX, 2004: 43-56.
[9]	Johnson F, Stoica R, Alilamaki A, et al.Decoupling contention management from scheduling[J]. ACM SIGARCH Computer Architecture News, 2010, 38(1): 117-128.
[10]	Sukwong O, Kim H S. Is co-scheduling too expensive for SMP VMs [C]// Proceedings of the 6th conference on Computer systems. Salzburg, Austria: ACM, 2011: 257-272.
[11]	Intel. Intelâ 64 and IA-32 architectures software developer manuals [Z/OL]. [2013-12-15]. http://www.intel.com/content/www/us/en/processors/architectures-software-developer-manuals.html.
[12]	AMD. Developer guides and manuals [Z/OL]. [2013-12-15]. http://developer.amd.com/resources/documentation-articles/developer-guides-manuals/.
[13]	DONG Yaozu, ZHENG Xudong, ZHANG Xiantao, et al.Improving virtualization performance and scalability with advanced hardware accelerations [C]// Proceedings of 2011 IEEE International Symposium on Workload Characterization. Austin, TX, USA: IEEE, 2010: 1-10.
[14]	Molnar I. CFS design [Z/OL]. [2013-12-15]. http://people.redhat.com/mingo/cfs-scheduler/sched-design-CFS.txt.
[15]	ZHANG Yanmin. HackBench [Z/OL]. [2013-12-15]. http://people.redhat.com/mingo/cfsscheduler/tools/hackbench.c.
[16]	Taylor M. SysBench [Z/OL]. [2013-12-15]. http://sysbench.sourceforge.net.

[1]	YU Xuefei, ZHANG Shuai, LIU Linlin, DU Jian. Carbon capture power plant scheduling based on information gap decision theory[J]. Journal of Tsinghua University(Science and Technology), 2022, 62(9): 1467-1473.
[2]	CHEN Junyu, TIAN Ling, DAI Jingzhou. Graph model and three-stage scheduling strategy for ship block storage yards[J]. Journal of Tsinghua University(Science and Technology), 2022, 62(12): 2003-2012.
[3]	WANG Fei, LIU Jinfei, YIN Xishuang, TAN Yaosheng, ZHOU Tiangang, YANG Zhiyue, FENG Bo, YANG Xiaolong. Intelligent scheduling for high arch dams[J]. Journal of Tsinghua University(Science and Technology), 2021, 61(7): 756-767.
[4]	ZHANG Tong, REN Fengyuan, SHU Ran. Distributed-optimization-based mix-flow scheduling mechanism for data center networks[J]. Journal of Tsinghua University(Science and Technology), 2021, 61(6): 618-625.
[5]	QIAN Peng, WU Cheng, SONG Shiji, DING Jianya. Rolling scheduling of reheating furnaces in steel production when some furnaces may not be available at times[J]. Journal of Tsinghua University(Science and Technology), 2021, 61(10): 1166-1176.
[6]	WANG Hengwei, LIN Jiarui, ZHANG Jianping. Resource-constrained project scheduling problem considering productivity and construction methods[J]. Journal of Tsinghua University(Science and Technology), 2020, 60(3): 271-277.
[7]	CHEN Xingshu, CHEN Jiaxin, ZHAO Dandan, JIN Xin. Anomaly detection based on IO sequences in a virtual machine with the Markov mode[J]. Journal of Tsinghua University(Science and Technology), 2018, 58(4): 395-401,410.
[8]	XU Yuanchao, YANG Lu. Task scheduling on a many-core processor for high-volume throughput applications[J]. Journal of Tsinghua University(Science and Technology), 2017, 57(3): 244-249.
[9]	JIANG Zhuo, WU Qian, LI Hewu, WU Jianping. Link on-off prediction based multipath transfer optimization for aircraft[J]. Journal of Tsinghua University(Science and Technology), 2017, 57(12): 1239-1244.
[10]	LIU Yang, WEI Wei. Fast Nash bargaining algorithm for resource scheduling problems with a large number of media streaming channels[J]. Journal of Tsinghua University(Science and Technology), 2017, 57(10): 1056-1062.
[11]	WANG Lei, KUANG Linling, HUANG Huiming. TDRSS traffic model based on time and spatial characteristics[J]. Journal of Tsinghua University(Science and Technology), 2017, 57(1): 55-60,66.
[12]	KANG Kai, CHEN Tao, YUAN Hongyong. Cooperative scheduling model for multi-level emergency response teams[J]. Journal of Tsinghua University(Science and Technology), 2016, 56(8): 830-835,843.
[13]	SHI Lei, JIANG Yongheng, WANG Ling, HUANG Dexian. Lagrangian decomposition approach for solving continuous-time scheduling models of refinery production problems[J]. Journal of Tsinghua University(Science and Technology), 2016, 56(4): 437-447.
[14]	TIAN Wenhong, LI Guozhong, CHEN Yu, HUANG Chaojie, YANG Wutong. Combined load balancing and energy efficiency in Hadoop[J]. Journal of Tsinghua University(Science and Technology), 2016, 56(11): 1226-1231.
[15]	GUO Jun, YAN Yongming, MA Anxiang, ZHANG Bin. Eliminating hot-spots based on cold-spot virtual machine migration in the cloud[J]. Journal of Tsinghua University(Science and Technology), 2016, 56(11): 1232-1236.

Viewed

Full text

Abstract

Cited

Shared

Discussed