Dynamic Scheduling Methods for Computational Grid Environments
Date Issued
2005-07-31
Date
2005-07-31
Author(s)
DOI
932213E002023
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.
Subjects
dynamic scheduling
grid computing
most
fit task first
fit task first
work queue
Publisher
臺北市：國立臺灣大學電機工程學系暨研究所
Type
report
File(s)![Thumbnail Image]()
Loading...
Name
932213E002023.pdf
Size
157.92 KB
Format
Adobe PDF
Checksum
(MD5):647aebc2b614b72c496848b82473809f