Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
I was surprised by how much more memory diagonal SDC needs compared to space-only parallelism. Unfortunately, I didn't find an easy solution. Instead, I just removed one unnecessary memory allocation.
In diagonal SDC, the solution and right hand side evaluation is stored at only one collocation node. But also the solution and RHS at the initial conditions is stored and every task stores the solution to the step.$\frac{2\times 4}{5}=1.6$ times the memory compared to space-only parallelism each. And $u_\mathrm{end}$ is four times as large.
Compared to space-only parallelism at the same number of overall tasks, all solution size objects are larger by the number of tasks in time.
If one uses four tasks in time / four colocation nodes, the solution and RHS evals in diagonal SDC take up
The solution size objects therefore require about six times as much memory in diagonal SDC when running in parallel on the same number of tasks compared to space-only parallel. This factor of roughly 6 is also what I measured in actual runs.