An Efficient Resource Scheduling Algorithm using Dynamic Priority in Grid Computing

Grid Computing is a dynamic, heterogeneous environment. Scheduling is the heart of Grid computing. There are two Basic categories of scheduling in Grid: Resource Scheduling and Job Scheduling. Resources can be selected as per user demand and on the basis of specific scheduling algorithm. User can submit their jobs in Grid and these jobs are allocated to the resources according to the selected algorithm. In Priority based Scheduling algorithm, Priority of jobs are basic concern. In this paper we provide the flexibility in priority of jobs in specific condition. So the Utilization of resources is high as in some specific situation lowest priority jobs can be allocated before to higher priority jobs to available resources without waiting its priority order. Because of this flexibility, proposed algorithm dramatically reduces the processing cost.