In issue731 Malte wrote:
"More generally, it is not ideal that we find out such bottlenecks more or less
by accident. Perhaps we can discuss how we can do things like these better in
the future, e.g. by having the results run include a categorical parameter that
explains what the bottleneck was and a numerical parameter that explains how
much time was spent on this bottleneck. To be really useful, this should also
adequately cover the case where we don't solve a task, i.e., where the
bottleneck leads to running out of time and memory. I think this shouldn't be
too difficult as long as the log output is clear enough to tell us at regular
checkpoints what the code is currently doing, at which point it started doing
it, and perhaps also what the peak memory usage at this point was."
|