A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A scalable, efficient scheme for evaluation of stencil computations over unstructured meshes
2013
Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis on - SC '13
Stencil computations are a common class of operations that appear in many computational scientific and engineering applications. Stencil computations often benefit from compiletime analysis, exploiting data-locality, and parallelism. Postprocessing of discontinuous Galerkin (dG) simulation solutions with B-spline kernels is an example of a numerical method which requires evaluating computationally intensive stencil operations over a mesh. Previous work on stencil computations has focused on
doi:10.1145/2503210.2503214
dblp:conf/sc/0007K13
fatcat:nycucp7l2fbvtm2qbm53wkol5u