Hierarchization for the Sparse Grid Combination Technique
classification
💻 cs.DC
cs.NAmath.NA
keywords
combinationhierarchizationtechniquegridperformancesparseachievesalgorithm
read the original abstract
The sparse grid combination technique provides a framework to solve high dimensional numerical problems with standard solvers. Hierarchization is preprocessing step facilitating the communication needed for the combination technique. The derived hierarchization algorithm outperforms the baseline by up to 30x and achieves close to 5% of peak performance. It also shows stable performance for the tested data sets of up to 1 GB.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.