Abstract
Grid Computing provides seamless and scalable access to wide-area distributed resources. Since, computational grid shares, selects and aggregates wide variety of geographically distributed computing resources and presents them as a single resource for solving large scale computing applications, there is a need for a scheduling algorithm which takes into account the various requirements of grid environment. Hence, this research proposes a new scheduling algorithm for computational grids that considers load balancing, fault tolerance and user satisfaction based on the grid architecture, resource heterogeneity, resource availability and job characteristics such as user deadline. This algorithm reduces the makespan of the schedule along with user satisfaction and balanced load. A simulation is conducted using Grid Simulator Toolkit (GridSim). The simulation results shows that the proposed algorithm has better makespan, hit rate and resource utilization.
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 Advanced Science and 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.
