A new scheme for improving the utilisation of nested-cloud resources
by Yuan Ni; Zhiwei Zhang; Xiaoling Tao
International Journal of Embedded Systems (IJES), Vol. 11, No. 2, 2019

Abstract: In recent years, cloud computing has played an important role in IT fields. It brings benefits such as high computing efficiency, cost saving, provisioning on-demand of computing resources and high utilisation of the hardware. However, with more fields and businesses involved in cloud computing, the inherent problems in its structure are restricting the further development of cloud computing. And the most serious problem is how to maximumly achieve the high-usage of the cloud resources. In this paper, we present a scheme based on multi-layer nested virtualisation technology. It can make full use of the allocations of a virtual machine (VM) provided by an infrastructure-as-a-service (IaaS) provider. Furthermore, we also propose a task scheduling approach for nested cloud environment correspondingly. The task scheduling algorithm considers both the computing efficiency and the monetary costs paid for the cloud service. In order to justify our proposal, we use KVM as unmodified multiple hypervisor to run multi-layer VMs on x86 platform. We also do simulations to test our task scheduling algorithm. And the result shows encouraging support for our proposal.

Online publication date: Wed, 13-Mar-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Embedded Systems (IJES):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com