An efficient job scheduling algorithm for grid computing

Authors:
Sarpreet Singh;RK Bawa
Affiliations:
Gian Sagar Medical College, Banur, Patiala, India;Department of Computer Science Punjabi University, Patiala, India
Venue:
ACAI '11 Proceedings of the International Conference on Advances in Computing and Artificial Intelligence
Year:
2011

Citing 3
Cited 0

Heuristics for Scheduling Parameter Sweep Applications in Grid Environments

HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
Grid resource management: state of the art and future trends

Grid resource management: state of the art and future trends
Genetic Algorithm Based Scheduler for Computational Grids

HPCS '05 Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The emerging computational grid infrastructure consists of heterogeneous resource in widely distributed autonomous domain, which makes resources scheduling even more challenging. The most common objective function of task scheduling problem is makespan. In this paper, I have proposed an efficient Job scheduling algorithm for the grid environment so that the jobs are executed in minimum time and also all nodes of grid execute equal load relative to their executing power. This technique fetches the jobs from the job queue that is ready to execute and assign these jobs to the best nodes of the grid.