Extended Min-Min Scheduling Algorithm in Cloud Computing
By: Maipan-Uku, J. Y
.
Contributor(s): Mishra, A.
Publisher: Tamil Nadu i-manager's 2018Edition: Vol.5(2), Jul-Dec.Description: 20-26p.Subject(s): Computer EngineeringOnline resources: Click here
In:
i-manager's journal on cloud computing (JCC)Summary: Cloudlet scheduling seems to be the most fundamental problem of cloud computing as per Infrastructure as a Service (IaaS). Proper scheduling in cloud lead to load balancing, minimization of makespan, and adequate resources utilization. To meet consumers' expectations, the execution of cloudlet simultaneously is required. Many algorithms have been implemented to solve the cloud scheduling problem. This include Min-Min which gave priority to cloudlet with minimum completion time. Min-Min scheduling algorithm has two clear weaknesses; a high value of makespan being generated and low resource utilization. To address these problems, this research proposes an Extended Min-Min Algorithm which assigns cloudlet base on the differences between maximum and minimum execution time of cloudlets. CloudSim was used to implement and compare the performances of the proposed algorithm with the benchmarks. The results of the extensive experiments show that the proposed algorithm is able to perform better in terms of makespan minimization compared to the existing heuristics.
| Item type | Current location | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|
Articles Abstract Database
|
School of Engineering & Technology Archieval Section | Not for loan | 2019881 |
Cloudlet scheduling seems to be the most fundamental problem of cloud computing as per Infrastructure as a Service (IaaS). Proper scheduling in cloud lead to load balancing, minimization of makespan, and adequate resources utilization. To meet consumers' expectations, the execution of cloudlet simultaneously is required. Many algorithms have been implemented to solve the cloud scheduling problem. This include Min-Min which gave priority to cloudlet with minimum completion time. Min-Min scheduling algorithm has two clear weaknesses; a high value of makespan being generated and low resource utilization. To address these problems, this research proposes an Extended Min-Min Algorithm which assigns cloudlet base on the differences between maximum and minimum execution time of cloudlets. CloudSim was used to implement and compare the performances of the proposed algorithm with the benchmarks. The results of the extensive experiments show that the proposed algorithm is able to perform better in terms of makespan minimization compared to the existing heuristics.
Click on an image to view it in the image viewer
There are no comments for this item.