Name
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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1109/ICPADS.2005.138 | ICPADS (1) |
Keywords | Field | DocType |
dynamic scheduling methods,task execution time,heterogeneous computing node,existing static scheduling method,dynamic task arrival,stable task execution time,computational grid environments,scheduling method,computational grid,dynamic scheduling method,fit task,distributed computing,application software,computer applications,grid computing,parallel processing,dynamic scheduling,heterogeneous computing | Fixed-priority pre-emptive scheduling,Fair-share scheduling,Computer science,Parallel computing,Flow shop scheduling,Real-time computing,Two-level scheduling,Rate-monotonic scheduling,Earliest deadline first scheduling,Dynamic priority scheduling,Round-robin scheduling,Distributed computing | Conference |
ISBN | Citations | PageRank |
0-7695-2281-5-01 | 16 | 0.73 |
References | Authors | |
13 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sheng-De Wang | 1 | 720 | 68.13 |
| I-Tar Hsu | 2 | 16 | 0.73 |
| Zheng Yi Huang | 3 | 16 | 0.73 |