An online scheduling algorithm for grid computing systems

Hak Du Kim, Jin Suk Kim

Research output: Contribution to journalArticlepeer-review

19 Scopus citations


Since the problem of scheduling independent jobs in heterogeneous computational resources is known as NP-complete [4], an approximation or heuristic algorithm is highly desirable. Grid is an example of the heterogeneous parallel computer system. Many researchers propose heuristic scheduling algorithm for Grid [1], [8], [9], [10]. In this paper, we propose a new on-line heuristic scheduling algorithm. We show that our scheduling algorithm has better performance than previous scheduling algorithms by extensive simulation.

Original languageEnglish
Pages (from-to)34-39
Number of pages6
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
StatePublished - 2004


Dive into the research topics of 'An online scheduling algorithm for grid computing systems'. Together they form a unique fingerprint.

Cite this