Hupp, Phillip; Jacob, Riko; Heene, Mario; Pflüger, Dirk; Hegland, Markus
High-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...[Show more]
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.