Name
Abstract | ||
|---|---|---|
We analyze performance properties of list scheduling algorithms under various dynamic assumptions and different levels of knowledge available for scheduling, considering the case of unit execution time tasks. We focus on bounds for the ISF (immediate successors first) and MISF (maximum number of immediate successors first) scheduling strategies and show the difference from other bounds obtained for the same problem. Finally, we present case studies and experimental results to assess the average behavior. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1016/S0377-2217(02)00236-9 | European Journal of Operational Research |
Keywords | Field | DocType |
Scheduling,List scheduling,Worst case analysis,On-line scheduling,UET | Fixed-priority pre-emptive scheduling,Mathematical optimization,Fair-share scheduling,Computer science,Deadline-monotonic scheduling,Algorithm,Two-level scheduling,Rate-monotonic scheduling,Dynamic priority scheduling,Earliest deadline first scheduling,Round-robin scheduling | Journal |
Volume | Issue | ISSN |
146 | 2 | 0377-2217 |
Citations | PageRank | References |
6 | 0.49 | 10 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Antonio Rodríguez Díaz | 1 | 126 | 11.51 |
| Andrei Tchernykh | 2 | 427 | 50.05 |
| Klaus H. Ecker | 3 | 44 | 8.31 |