KERNEL CONVOLUTION FOR STENCIL COMPUTATION OPTIMIZATION

摘要

Data processing techniques are provided to increase a computational speed of iterative computations that are performed over a domain of data points, such as stencil computations. For example, a method includes loading a set of domain data points into a cache memory; obtaining an iteration count T, and a base stencil operator having a first set of coefficients; generating a convolved stencil operator having a second set of coefficients, wherein the convolved stencil operator is generated by convolving the base stencil operator with itself at least one time; and iteratively processing the set of domain data points in the cache memory using the convolved stencil operator no more than T/2 iterations to obtain final processing results. The final processing results are similar to processing results that would be obtained by iteratively processing the set of domain data points using the base stencil operator for the iteration count T.