Abstract
A grid is a large-scale, heterogeneous, dynamic collection of independent computers, geographically distributed and interconnected with high speed networks. The resources making up a grid need to be managed to provide a good quality of service. Grid scheduling is a vital component of a Computational Grid infrastructure. Typically scheduling challenges tend to be NP-hard problems where there is no optimal solution. Here we are proposing a modified prioritized deadline based scheduling algorithm (MPDSA) using project management techniques for efficient job execution with deadline constraints of users jobs. An extensive performance comparison has been presented using synthetic workload traces to evaluate the efficiency and robustness of grid scheduling with respect to average turnaround time, average waiting time and maximum tardiness. The result has shown improved performance under dynamic scheduling environment. Based on the comparative performance analysis, proposed MPDSA has shown the optimal performance as compared to PDSA, FCFS and RR scheduling algorithms under dynamic scheduling environment. (C) 2012 Elsevier B.V ... Selection and peer-review under responsibility of Bin Nusantara University