EJS']JS Algorithm for Job Scheduling in Grid Environment

Grid computing is a term referring to the combination of computer resources from multiple administrative domains to reach a common goal. The use of powerful computing resources transparently available to the user via a networked environment is the aim of grid computing. Grid systems enable the sharing and aggregation of geographically distributed resources for solving large-scale problems in science, engineering, and commerce. There are several scheduling algorithms presently available in grid system for resource and job scheduling. Scheduling onto the Grid is NP-complete problem [11], so there is no best scheduling algorithm for any grid computing system. An alternative is to select an appropriate scheduling algorithm to use in a specific grid environment. It depends on the characteristics of the tasks, machines and network connectivity. By this research paper, our aim is to analyze the existing algorithms and propose an optimal algorithm for job scheduling in grids.