Dynamic Scheduling Methods for Computational Grid Environments

Authors:
Sheng-De Wang;I-Tar Hsu;Zheng Yi Huang
Affiliations:
Department of Electrical Engineering National Taiwan University, Taipei, TAIWAN;Department of Electrical Engineering National Taiwan University, Taipei, TAIWAN;Department of Electrical Engineering National Taiwan University, Taipei, TAIWAN
Venue:
ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Volume 01
Year:
2005

Citing 0
Cited 4

Selecting the most fitting resource for task execution

Future Generation Computer Systems
Improving job scheduling algorithms in a grid environment

Future Generation Computer Systems
An Adaptive Scoring Job Scheduling algorithm for grid computing

Information Sciences: an International Journal
Multi-Criteria Job Scheduling in Grid Using an Accelerated Genetic Algorithm

Journal of Grid Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose an adaptive and dynamic scheduling method, called most fit task first (MFTF), for a class of computational grids, which are characterized by heterogeneous computing nodes and dynamic task arrivals. Some existing static scheduling methods assume that tasks arrive statically and may not perform well in the case of dynamic task arrivals. Our method can get stable task execution times whether tasks arrive statically or dynamically. We compare the task execution time with other methods to show the performance of the scheduling method.