Abstract
Because the task scheduling problem is np-complete problem, it is hard to find a deterministic algorithm to solve the problem of task scheduling in the cloud computing platform. Therefore this paper presents a task scheduling mechanism based on simulated annealing algorithm. The algorithm is a modern heuristic algorithm and overcome the shortcoming of the local optimum search method. The algorithm uses a greedy algorithm to generate the initial value, and heat to a sufficiently high temperature and according to certain rules to generate a new value. If the new value is better than the original value or at a certain probability can be accepted, then replace the original value with the new value until cool. Experiments proved the feasibility and effectiveness of the algorithm. Compared with traditional algorithms, this task scheduling mechanism not only meets the needs of users and improves the performance of the system.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Hybrid Information Technology
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.
