Name
Abstract | ||
|---|---|---|
A counterexample to the supposed optimality of an algorithm for generating schedules for trees of tasks with unequal execution times is presented. A comparison with the “critical path” heuristic is discussed. |
Year | DOI | Venue |
|---|---|---|
1973 | 10.1145/355611.362545 | Communications of the ACM |
Keywords | Field | DocType |
scheduling,arithmetic expression,task scheduling,supposed optimality,unequal execution time,multiprocessor scheduling,critical path,tree scheduling | Heuristic,Multiprocessor scheduling,Computer science,Parallel computing,Flow shop scheduling,Arithmetic,Theoretical computer science,Schedule,Critical path method,Counterexample,Earliest deadline first scheduling,Foreground-background | Journal |
Volume | Issue | ISSN |
16 | 11 | 0001-0782 |
Citations | PageRank | References |
3 | 3.86 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peter J. Denning | 1 | 3882 | 1789.15 |
| G. Scott Graham | 2 | 703 | 110.49 |