Open steob92 opened 4 months ago
When generating backgrounds we need to think of where and how to parallelize the code. It's not clear to me what option is better.
Say we have a runlists of N runs each of which require X hours of backgrounds. To find these backgrounds we need to look at M background runs.
Should we:
While N (O(10)) << M (O(100)) the answer is clear but as N -> M we might want to look at better optimizations.
When generating backgrounds we need to think of where and how to parallelize the code. It's not clear to me what option is better.
Say we have a runlists of N runs each of which require X hours of backgrounds. To find these backgrounds we need to look at M background runs.
Should we:
While N (O(10)) << M (O(100)) the answer is clear but as N -> M we might want to look at better optimizations.