A Two-Step QoS Priority for Scheduling in Grid

Quality of Service (QoS) is an important property of Scheduling. Demand of QoS is varying from application to application. In the case of scheduling, it is nothing but task and processor requirements. Task requirement refers to bandwidth, speed, operating system, architecture and many more of the processor. But, processor requirement refers to data size, location, deadline, trust level and many more of the task. Our goal is to match and schedule the task-processor pair which leads to reduction in Makespan. In this paper, we propose a two-step QoS priority for scheduling in Grid. Bounded and unbounded priorities are introduced as a two-step priority. Based on the priority, tasks are schedule to the processor. Our experiment case shows optimum result than previous scheduling algorithms like Min-Min, QoS guided Min-Min algorithm.