As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
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 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.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.