Immediate Mode Scheduling of Independent Jobs in Computational Grids

Abstract

With the emerging paradigm of grid computing and the development of grid infrastructures, grid-based applications are becoming a common approach for solving many complex, large-scale problems in science and engineering. In order to benefit from the large computing power of grid systems, efficient allocation of jobs to resources is necessary. In this work, we consider the allocation problem in immediate mode, in which jobs are allocated as soon as they arrive in the system. We implemented several methods and measured four parameters of the system: makespan, flowtime, resource utilization and matching proximity. The immediate methods are especially interesting when good quality allocations are necessary in very short time. The considered methods have been tested using the most difficult benchmark in the literature for the problem. The computational results allowed us to identify which of considered methods perform better for makespan, flowtime, resource utilization and matching proximity. Also, we were able to evaluate the usefulness of such methods if we knew in advance certain grid characteristics such as degree of consistency of computing, heterogeneity of jobs and resources.

A GA(TS) Hybrid Algorithm for Scheduling in Computational Grids

“…Both GAs and TS have been developed for the independent task scheduling in Xhafa et al [11] and [12] in sequential setting. We have considered the Steady-State GA in this work.…”

“…Recently, heuristic approaches have been presented for the problem [1,7,9,11,10,12], however, proper hybrid approaches are lacking. Our hybrid approach combines Genetic Algorithms (GAs) and Tabu Search (TS) methods.…”

A Compendium of Heuristic Methods for Scheduling in Computational Grids

“…Ritchie [7] implemented the TS for the problem under ETC model and used it in combination with ACO approach. Xhafa et al [14] has presented a full featured TS for the scheduling problem under ETC model.…”

Performance Comparison of Three Batch-Mode Scheduling Heuristics

“…In [5] & [6], on-line load adjusting calculation for desktop networks are depicted and it is analyzed that desktop Grid scheduling can be performed in a unified manner or in a completely dispersed manner and they needn't bother with a worldwide scheduler. In [7] & [8], Schedulers in this class accept the information of the execution time of individual tasks, and exploit different kind of static or dynamic resource data to perform resource determination.…”