Intermediate mode scheduling in computational grid

Mode of Scheduling plays the key role in Grid Scheduling. It is of two types, immediate and batch mode. Immediate mode takes one by one task in a sequence. But the batch mode takes in a random sequence. So, task assignment is mainly based on the mode selection. The task may be assigned to the resource as soon as arrive or in a batch. In this paper, we have introduced a new mode of heuristic called as intermediate mode (or Multi-ζ batch mode). This mode considers the random arrival of task in a multi-batch sequence. Alternatively, arrivals of tasks are unknown in this mode. Here, we have taken a range of task arrival for simplicity. This mode is introduced to be a part of the real life aspects. The two existing batch mode heuristics: Min-Min and Max-Min are experimented with intermediate mode scheduling. We have taken two performance measures, makespan and resource utilization to evaluate the performance.