An efficient VM scheduling algorithm to minimize the makespan and maximize the profit

Virtual Machines (VMs) in Cloud systems are scheduled to host based on the usage of instant resource, namely hosts that are equipped with the highest RAM that is available. This is done without taking their long-term and overall utilization into account. The main issue of VM scheduling is that, it l...

Full description

Saved in:

Bibliographic Details
Main Author:	Ibrahim, Aws Fadhil
Format:	Thesis
Language:	English
Published:	2019
Subjects:	Cloud computing Virtual computer systems
Online Access:	http://psasir.upm.edu.my/id/eprint/82948/1/FSKTM%202019%2027%20IR.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-upm-ir.82948
record_format	uketd_dc
spelling	my-upm-ir.829482020-07-23T04:07:41Z An efficient VM scheduling algorithm to minimize the makespan and maximize the profit 2019 Ibrahim, Aws Fadhil Virtual Machines (VMs) in Cloud systems are scheduled to host based on the usage of instant resource, namely hosts that are equipped with the highest RAM that is available. This is done without taking their long-term and overall utilization into account. The main issue of VM scheduling is that, it lowers the performance of a system. It is used to schedule tasks for better utilization of resources by allocating certain tasks to particular resources at a particular time. VM scheduling in cloud means to select the most suitable and outstanding resource attainable for execution of tasks or to appoint computer machined to task in such a method that the fulfillment time is reduced as workable. In this study, we focus on improving the scheduling performance of VM, namely on the cost and makespan. The process of VM scheduling includes three main processes. The first process is VM cluster formation based on the characteristics such as CPU, Memory and bandwidth. The second process is hyper analytical task scheduling algorithm, and based on the scheduled task, the policy based profit maximization algorithm was proposed in final process. The comparison of the performance of proposed work is analyzed through some empirical results. The findings have demonstrated that the proposed work has decreased the task scheduling makespan significantly and gives high profit compared with the other scheduling algorithms. Cloud computing Virtual computer systems 2019 Thesis http://psasir.upm.edu.my/id/eprint/82948/ http://psasir.upm.edu.my/id/eprint/82948/1/FSKTM%202019%2027%20IR.pdf text en public masters Universiti Putra Malaysia Cloud computing Virtual computer systems Ariffin, Ahmad Alauddin
institution	Universiti Putra Malaysia
collection	PSAS Institutional Repository
language	English
advisor	Ariffin, Ahmad Alauddin
topic	Cloud computing Virtual computer systems
spellingShingle	Cloud computing Virtual computer systems Ibrahim, Aws Fadhil An efficient VM scheduling algorithm to minimize the makespan and maximize the profit
description	Virtual Machines (VMs) in Cloud systems are scheduled to host based on the usage of instant resource, namely hosts that are equipped with the highest RAM that is available. This is done without taking their long-term and overall utilization into account. The main issue of VM scheduling is that, it lowers the performance of a system. It is used to schedule tasks for better utilization of resources by allocating certain tasks to particular resources at a particular time. VM scheduling in cloud means to select the most suitable and outstanding resource attainable for execution of tasks or to appoint computer machined to task in such a method that the fulfillment time is reduced as workable. In this study, we focus on improving the scheduling performance of VM, namely on the cost and makespan. The process of VM scheduling includes three main processes. The first process is VM cluster formation based on the characteristics such as CPU, Memory and bandwidth. The second process is hyper analytical task scheduling algorithm, and based on the scheduled task, the policy based profit maximization algorithm was proposed in final process. The comparison of the performance of proposed work is analyzed through some empirical results. The findings have demonstrated that the proposed work has decreased the task scheduling makespan significantly and gives high profit compared with the other scheduling algorithms.
format	Thesis
qualification_level	Master's degree
author	Ibrahim, Aws Fadhil
author_facet	Ibrahim, Aws Fadhil
author_sort	Ibrahim, Aws Fadhil
title	An efficient VM scheduling algorithm to minimize the makespan and maximize the profit
title_short	An efficient VM scheduling algorithm to minimize the makespan and maximize the profit
title_full	An efficient VM scheduling algorithm to minimize the makespan and maximize the profit
title_fullStr	An efficient VM scheduling algorithm to minimize the makespan and maximize the profit
title_full_unstemmed	An efficient VM scheduling algorithm to minimize the makespan and maximize the profit
title_sort	efficient vm scheduling algorithm to minimize the makespan and maximize the profit
granting_institution	Universiti Putra Malaysia
publishDate	2019
url	http://psasir.upm.edu.my/id/eprint/82948/1/FSKTM%202019%2027%20IR.pdf
_version_	1747813334233645056

An efficient VM scheduling algorithm to minimize the makespan and maximize the profit

Similar Items