Offerng A meta-Heuristic Algorithm For Scheduling Algorithms In The Cloud By Bees Colony Algorithm
عنوان مقاله: Offerng A meta-Heuristic Algorithm For Scheduling Algorithms In The Cloud By Bees Colony Algorithm
شناسه ملی مقاله: CITCOMP02_015
منتشر شده در دومین کنفرانس بین المللی پژوهش های دانش بنیان در مهندسی کامپیوتر و فناوری اطلاعات در سال 1396
شناسه ملی مقاله: CITCOMP02_015
منتشر شده در دومین کنفرانس بین المللی پژوهش های دانش بنیان در مهندسی کامپیوتر و فناوری اطلاعات در سال 1396
مشخصات نویسندگان مقاله:
M.R hosseinzadeh - Department of Computer, Islamic Azad University, Dorud, Iran
k hassani - Department of Computer, Islamic Azad University, Malayer, Iran
e heydari - Department of Computer, Islamic Azad University, Dorud, Iran
خلاصه مقاله:
M.R hosseinzadeh - Department of Computer, Islamic Azad University, Dorud, Iran
k hassani - Department of Computer, Islamic Azad University, Malayer, Iran
e heydari - Department of Computer, Islamic Azad University, Dorud, Iran
Scheduling tasks in cloud computing is an NP-hard problem. Load balancing of tasks on virtual machines is an essential part in scheduling the cloud. For loading operations in virtual machines, load balancing process should be performed to reach an optimal state. In this paper, analgorithm is suggested that is a combination of bees and annealing algorithms. As bee colony bee colony algorithm is not a convergent algorithm and is caught in trap of local optimum, in this article we tried to solve this problem by using annealing algorithm. At the end, the proposed algorithm has been compared with PSO and GA algorithms. The results show that the above algorithm has a significant impact on the optimization of the two elements compared to PSO and GA algorithms
کلمات کلیدی: cloud scheduler, algorithm, bees, annealing, optimized
صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/695957/