Local cover image
Local cover image
Image from Google Jackets

Extended Min-Min Scheduling Algorithm in Cloud Computing

By: Contributor(s): Publication details: Tamil Nadu i-manager's 2018Edition: Vol.5(2), Jul-DecDescription: 20-26pSubject(s): Online resources: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Status Barcode
Articles Abstract Database Articles Abstract Database School of Engineering & Technology Archieval Section Not for loan 2019881
Total holds: 0

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.

There are no comments on this title.

to post a comment.

Click on an image to view it in the image viewer

Local cover image
Share
Unique Visitors hit counter Total Page Views free counter
Implemented and Maintained by AIKTC-KRRC (Central Library).
For any Suggestions/Query Contact to library or Email: librarian@aiktc.ac.in | Ph:+91 22 27481247
Website/OPAC best viewed in Mozilla Browser in 1366X768 Resolution.