...the idea is to use the sum of node weights per level to create a schedule, which more closely reflects the distribution of actual computation time. Hopefully such a schedule can then be squeezed or stretched by a time factor to find out a ''breaking point'', at which the Scheduler is no longer able to keep up. |
||
|---|---|---|
| .. | ||
| Dump-01 | ||
| Dump-02 | ||
| Dump-03 | ||
| Dump-04 | ||
| Dump-05 | ||
| Dump-06 | ||
| index.txt | ||
| SchedulerTestGraph.pdf | ||