Abstract

Since the task scheduling in grid computing faces a NP-hard problem, it leads very difficult to validate the methods of task scheduling. This paper combined with the advantages of two evaluative algorithms: genetic algorithm and simulated annealing, brings forward an hybrid evaluative algorithm and applied to solve task scheduling problem in grid computing. From the analysis and experiment result, it is concluded that this algorithm is superior to genetic algorithm and simulated annealing.

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 call

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.