Efficient consolidation-aware VCPU scheduling on multicore virtualization platform

Wang, Bei, Cheng, Yuxia, Chen, Wenzhi, He, Qinming, Xiang, Yang, Hassan, Mohammad Mehedi and Alelaiwi, Abdulhameed 2016, Efficient consolidation-aware VCPU scheduling on multicore virtualization platform, Future generation computer systems, vol. 56, pp. 229-237, doi: 10.1016/j.future.2015.08.007.

Attached Files
Name Description MIMEType Size Downloads

Title Efficient consolidation-aware VCPU scheduling on multicore virtualization platform
Author(s) Wang, Bei
Cheng, Yuxia
Chen, Wenzhi
He, Qinming
Xiang, Yang
Hassan, Mohammad Mehedi
Alelaiwi, Abdulhameed
Journal name Future generation computer systems
Volume number 56
Start page 229
End page 237
Total pages 9
Publisher Elsevier
Place of publication Amsterdam, The Netherlands
Publication date 2016-03
ISSN 0167-739X
Keyword(s) Science & Technology
Computer Science, Theory & Methods
Computer Science
Lock holder preemption
vCPU scheduling
Summary Multicore processors are widely used in today's computer systems. Multicore virtualization technology provides an elastic solution to more efficiently utilize the multicore system. However, the Lock Holder Preemption (LHP) problem in the virtualized multicore systems causes significant CPU cycles wastes, which hurt virtual machine (VM) performance and reduces response latency. The system consolidates more VMs, the LHP problem becomes worse. In this paper, we propose an efficient consolidation-aware vCPU (CVS) scheduling scheme on multicore virtualization platform. Based on vCPU over-commitment rate, the CVS scheduling scheme adaptively selects one algorithm among three vCPU scheduling algorithms: co-scheduling, yield-to-head, and yield-to-tail based on the vCPU over-commitment rate because the actions of vCPU scheduling are split into many single steps such as scheduling vCPUs simultaneously or inserting one vCPU into the run-queue from the head or tail. The CVS scheme can effectively improve VM performance in the low, middle, and high VM consolidation scenarios. Using real-life parallel benchmarks, our experimental results show that the proposed CVS scheme improves the overall system performance while the optimization overhead remains low.
Language eng
DOI 10.1016/j.future.2015.08.007
Field of Research 0805 Distributed Computing
0806 Information Systems
080309 Software Engineering
Socio Economic Objective 970108 Expanding Knowledge in the Information and Computing Sciences
HERDC Research category C1 Refereed article in a scholarly journal
ERA Research output type C Journal article
Copyright notice ©2015, Elsevier
Persistent URL http://hdl.handle.net/10536/DRO/DU:30082193

Document type: Journal Article
Collection: School of Information Technology
Connect to link resolver
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 4 times in TR Web of Science
Scopus Citation Count Cited 5 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 71 Abstract Views, 2 File Downloads  -  Detailed Statistics
Created: Mon, 14 Mar 2016, 16:23:10 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.