Average schedule length and resource selection policies on computational grids

Authors:
Uei-Ren Chen;Chien-Hsun Wang;Woei Lin
Affiliations:
Department of Computer Science, National Chung Hsing University, Taiwan, R.O.C.;Department of Computer Science, National Chung Hsing University, Taiwan, R.O.C.;Department of Computer Science, National Chung Hsing University, Taiwan, R.O.C.
Venue:
GPC'06 Proceedings of the First international conference on Advances in Grid and Pervasive Computing
Year:
2006

Citing 10
Cited 0

Introduction to algorithms

Introduction to algorithms
The grid: blueprint for a new computing infrastructure

The grid: blueprint for a new computing infrastructure
A comparison of list schedules for parallel processing systems

Communications of the ACM
Design and Evaluation of a Resource Selection Framework for Grid Applications

HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
Job Scheduling for Grid Computing on Metacomputers

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 4 - Volume 05
Communication Contention in Task Scheduling

IEEE Transactions on Parallel and Distributed Systems
Surfer: an extensible pull-based framework for resource selection and ranking

CCGRID '04 Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid
A resource management and fault tolerance services in grid computing

Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part II
Problems on Algorithms: Second Edition

Problems on Algorithms: Second Edition
NP-complete scheduling problems

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

The computational grid provides many resources with powerful computational ability; however, we need to select appropriate resources for resolving the problem. In this paper, several simple and fast resource selection policies are presented. Under varying types of resource topologies and problems, the efficiency of these resource selection policies is compared. The contribution of this research is following. To solve the undetermined resource problem in the grid computing, the bottom level equation is modified in the list scheduling algorithm. Average Schedule Length (ASL) is presented to approximate the schedule length of the improved list scheduling method, and simulation result shows the accuracy of this approximation. The bounded number of the resources is found by performing the FindAlpha algorithm. Simulation result shows that selection policies can achieve minimal schedule length efficiently by choosing the limited number of the resources.