Nonpreemptive Priority (NPRP) based Job Scheduling Model for Virtualized Grid Environment
Grid Computing is a widespread distributed computing environment that consists of heterogeneous resources and it provides huge computational power for the large scale distributed application. In this job scheduling is an essential objective to prioritize the jobs based on the job characteristics. It is a big challenge to design and implement an efficient Job Scheduling algorithm and the Job Scheduling model. This paper proposes the priority based Job Scheduling algorithm with Nonpreemptive Priority (NPRP) Job Scheduling model. The priority based job scheduling algorithm is the combination of Backfill algorithm and Earliest Deadline based algorithm. The proposed model has been integrated with Care Resource Broker (CRB) 11 which supports virtualized grid environment. The proposed model has been integrated with CRB helps to make the intelligent scheduling decisions for prioritizing the jobs and also the proposed model minimizes the turnaround time, waiting time and response time of the jobs available in the queue and the user’s quality of service has been maximized in the heterogenous and virtualized grid environment.
Grid Scheduling Job Scheduling Priority scheduling Nonpreemptive Priority Model Backfillin Earliest Deadline First
G.Kannan Dr.S. Thamarai Selvi
Research Associate, CARE,Dept of Computer Technology,Madras Institute of Technology,Anna University Professor and Head, Dept of Computer Technology, Madras Institute of Technology, Anna University Che
国际会议
成都
英文
1-5
2010-08-20（万方平台首次上网日期，不代表论文的发表时间）