X-DualMake: Novel Immediate Mode Scheduling Heuristics in Computational Grids

Abstract

Scheduling is an important aspect in grid computing. Now-a-days, the computational grids are the important platform for job scheduling. The performance of the computational grids can be improved using an efficient scheduling heuristic. In job scheduling, a user submits the job to the grid resource broker. Then the broker is responsible for dividing the job into a number of tasks. Moreover, it also maps the tasks and the resources to find the perfect match. The primary goal of scheduling is to minimize the processing time and maximize the resource utilization. In this paper, we have proposed three immediate mode heuristics such as First-DualMake, Best-DualMake and Worst-DualMake (named as XDualMake).These heuristic are scheduled based on the resource idle time. We have also presented five existing heuristics such as MET, MCT, OLB, KPB and SA. The eight heuristics are simulated and the experimental results are discussed. The heuristics are compared using two performance measures makespan and resource utilization.