Abstract
Resource allocation policies play a key role in determining the performance of cloud. Service providers in cloud computing have to provide services to many users simultaneously. So the job of allocating cloudlets to appropriate virtual machines is becoming one of the challenging issues of cloud computing. Many algorithms have been proposed to allocate cloudlets to the virtual machines. Here in our paper, we have represented cloudlet allocation problem as job assignment problem and we have proposed Hungarian algorithm based solution for allocating cloudlets to virtual machines. The main objective is to minimize total execution time of cloudlets. Proposed algorithm is implemented in Cloudsim-3.03 simulator. We have done comparative analysis of the simulation results of proposed algorithm with the existing First Come First Serve (FCFS) scheduling policy and Min-Min scheduling algorithm. Proposed algorithm performs better than the above mentioned algorithms in terms of total execution time and makespan time (finishing time of last cloudlet)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Innovative Technology and Exploring Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.