國立臺灣大學電機工程學系暨研究所王勝德2006-07-252018-07-062006-07-252018-07-062005-07-31http://ntur.lib.ntu.edu.tw//handle/246246/8027In 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.application/pdf161707 bytesapplication/pdfzh-TW國立臺灣大學電機工程學系暨研究所dynamic schedulinggrid computingmost fit task firstwork queuereport2-s2.0-23944445340http://ntur.lib.ntu.edu.tw/bitstream/246246/8027/1/932213E002023.pdf