Job Scheduling for Grid Computing on Metacomputers

Authors:
Keqin Li
Affiliations:
State University of New York
Venue:
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 4 - Volume 05
Year:
2005

Citing 12
Cited 4

Metacomputing

Communications of the ACM
Metasystems: an approach combining parallel processing and heterogeneous distributed computing systems

Journal of Parallel and Distributed Computing - Special issue on heterogeneous processing
Dynamic scheduling on parallel machines

Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Metasystems

Communications of the ACM
The grid: blueprint for a new computing infrastructure

The grid: blueprint for a new computing infrastructure
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Evaluation of Job-Scheduling Strategies for Grid Computing

GRID '00 Proceedings of the First IEEE/ACM International Workshop on Grid Computing
Scheduling in a Grid Computing Environment Using Genetic Algorithms

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Scheduling a Metacomputer with Uncooperative Sub-schedulers

IPPS/SPDP '99/JSSPP '99 Proceedings of the Job Scheduling Strategies for Parallel Processing
The NRW-Metacomputer-Building Blocks for A Worldwide Computational Grid

HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
Distributed Job Scheduling on Computational Grids Using Multiple Simultaneous Requests

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

CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid

Job scheduling and processor allocation for grid computing on metacomputers

Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part II
Job co-allocation strategies for multiple high performance computing clusters

Cluster Computing
Hierarchical scheduling mechanism for grid systems

IMSA '07 Proceedings of the Eleventh IASTED International Conference on Internet and Multimedia Systems and Applications
Average schedule length and resource selection policies on computational grids

GPC'06 Proceedings of the First international conference on Advances in Grid and Pervasive Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

Scheduling is a fundamental issue in achieving high performance on metacomputers and computational grids. For the first time, the job scheduling problem for grid computing on metacomputers is studied as a combinatorial optimization problem. It is proven that the list scheduling algorithm can achieve reasonable worst-case performance bound in grid environments supporting distributed supercomputing with large applications. It is also observed that communication heterogeneity does have significant impact on schedule lengths.