Abstract
Due to the availability of the excess computation power, the heterogeneous grid systems have significant predominance in higher performance and low cost. In this paper, a self-adaptive algorithm is proposed based on Simulated Annealing (SA) for grid scheduling to minimize the make span, in response to the grid dynamic characteristic. During the process of scheduling, partial scheduling information is exploited to decide the next partial scheduling parameters set, which is self-adaptive to the stochastic job arrival time. We simulated the algorithm in GridSim environment, and the simulation results demonstrated that the proposed algorithm improved performance compared to existing scheduling techniques.
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 callDisclaimer: 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.
