Hupp, PhilippJacob, RikoHeene, MarioPflüger, DirkHegland, Markus2026-01-012026-01-0197816149938030927-5452ORCID:/0000-0002-5136-2883/work/162291619https://hdl.handle.net/1885/733799016High-dimensional simulations pose a challenge even for next-generation high-performance computers. Hierarchical methods can reduce these extreme computational demands, but they tend to introduce more complicated communication patterns. One such approach is the sparse grid combination technique that splits the problem into several smaller full grids that are synchronized regularly. We analyze this communication task for arbitrary dimension d by deriving lower bounds and giving algorithms. For the special 2-dimensional case we present an algorithm that is optimal up to constant factors. These theoretical results are supported by preliminary experiments. The baseline Sparse Grid Reduce is based on a single AllReduce. The new approach Subspace Reduce beats this baseline by up to 10x in two and 3.5x in three dimensions for large discretization levels.10enCombination TechniqueCost MeasuresGlobal CommunicationLower BoundsSparse GridsTrade-Offs201410.3233/978-1-61499-381-0-56484902239638