Ichthyostega
e9e7d954b1
The intention is to establish a theoretical limit for the expense, given some degree of concurrency. In reality, the expense should always be greater, since the time is not just split by the number of cores; rather we need to chain up existing jobs of various weight on the available cores (which is a special case of the box packing problem). With this formula, an ideal weight factor can be determined for each level, and then summing up the sequence of levels gives us a guess for a sensible timing for the overall scheduler |
||
|---|---|---|
| .. | ||
| gear | ||
| mem | ||
| DIR_INFO | ||