Reconciling Time Slice Conflicts of Virtual Machines With Dual Time Slice for Clouds

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 61
  • Download : 0
The proliferation of system virtualization poses a new challenge for the coarse-grained time sharing techniques for consolidation, since operating systems are running on virtual CPUs. The current system stack was designed under the assumption that operating systems can seize CPU resources at any moment. However, for the guest operating system on a virtual machine (VM), such assumption cannot be guaranteed, since virtual CPUs of VMs share a limited number of physical cores. Due to the time-sharing of physical cores, the execution of a virtual CPU is not contiguous, with a gap between the virtual and real time spaces. Such a virtual time discontinuity problem leads to significant inefficiency for lock and interrupt handling, which rely on the immediate availability of CPUs whenever the operating system requires computation. To reduce scheduling latencies of virtual CPUs, shortening time slices can be a straightforward strategy, but it may lead to the increased overhead of context switching costs across virtual machines for some workloads. It is challenging to determine a single time slice to satisfy all the VMs. In this article, we propose to have dual time slice to resolve the time slice conflict problem occurred in different types of virtual machines.
Publisher
IEEE COMPUTER SOC
Issue Date
2020-10
Language
English
Article Type
Article
Citation

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, v.31, no.10, pp.2453 - 2465

ISSN
1045-9219
DOI
10.1109/TPDS.2020.2993252
URI
http://hdl.handle.net/10203/275370
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0