A cost-based online scheduling algorithm for job assignment on computational grids

Chuliang Weng, Xinda Lu

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

2 Scopus citations

Abstract

The computational grid provides a promising platform for the deployment of various high-performance computing applications. Problem in implementing computational grid environments is how to effectively use various resources in the system, such as compute cycle, memory, communication network, and data repository. There are many effective heuristic algorithms for scheduling in the computational grid, however most scheduling strategies have no theoretical guarantees at all. This paper expands on the previous work, which considers CPU and memory with economic principle in the cluster environment. A cost-based online scheduling algorithm is presented for job assignment in the grid environment, and the performance of the algorithm is analyzed against the performance of the optimal offline algorithm.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsXingming Zhou, Ming Xu, Stefan Jahnichen, Jiannong Cao
PublisherSpringer Verlag
Pages343-351
Number of pages9
ISBN (Print)3540200541, 9783540200543
DOIs
StatePublished - 2003
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2834
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'A cost-based online scheduling algorithm for job assignment on computational grids'. Together they form a unique fingerprint.

Cite this