Intermediate mode scheduling in computational grid
Task scheduling is the most challenging work in grid environment. Scheduling approach is based on various criteria's like Quality of Service (QoS), deadline, security, the arrival time of the task, suffrage value etc. It is difficult to get the optimal solution with a unified approach. In this paper, we propose a threshold based technique to decide the task assignments to the machines. It also describes a value to balance the load. Our experimental analysis shows better results than traditional task scheduling algorithms such as Minimum Execution Time (MET), Minimum Completion Time (MCT), Min-Min, Max-Min, K-Percent Best (KPB) and suffer-age heuristic.