Name
Abstract | ||
|---|---|---|
Dynamic scheduling on a heterogeneous system was implemented to minimize the application program execution time. Our method decomposes the program workload into computationally homogeneous subtasks, which may be of different size, depending on the current load of each machine in the heterogeneous computer system. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1007/3-540-49164-3_61 | ACPC |
Keywords | Field | DocType |
application program execution time,dynamic scheduling,current load,program workload,computationally homogeneous subtasks,heterogeneous system,network heterogeneous computer system,different size,heterogeneous computer system,heterogeneous computing | Homogeneous,Load balancing (computing),Workload,Computer science,Parallel computing,Parallel processing,Symmetric multiprocessor system,Real-time computing,Travelling salesman problem,Execution time,Dynamic priority scheduling,Distributed computing | Conference |
Volume | ISSN | ISBN |
1557 | 0302-9743 | 3-540-65641-3 |
Citations | PageRank | References |
2 | 0.49 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Janez Brest | 1 | 2190 | 90.76 |
| Viljem Zumer | 2 | 268 | 21.78 |
| Milan Ojstersek | 3 | 3 | 4.28 |