The Pochoir Stencil Compiler
A stencil computation repeatedly updates each point of a d-dimensional grid as a function of itself and its near neighbors. Parallel cache-efficient stencil algorithms based on "trapezoidal decompositions" are known, but most programmers find them difficult to write. The Pochoir stencil co...
Main Authors: | Tang, Yuan, Chowdhury, Rezaul, Kuszmaul, Bradley C., Luk, Chi-Keung, Leiserson, Charles E. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | en_US |
Published: |
Association for Computing Machinery (ACM)
2012
|
Online Access: | http://hdl.handle.net/1721.1/72122 https://orcid.org/0000-0003-4059-765X |
Similar Items
-
Stenciling/
by: 246688 Parry, Megan
Published: (1977) -
The Connection Machine CM-5, Moore's Law, and the Future of Computational Performance
by: Kuszmaul, Bradley, et al.
Published: (2023) -
Transactions Everywhere
by: Kuszmaul, Bradley C., et al.
Published: (2003) -
Stencils and masks /
by: 303634 Martin, Judy
Published: (1988) -
AUTOGEN: automatic discovery of cache-oblivious parallel recursive algorithms for solving dynamic programs
by: Chowdhury, Rezaul, et al.
Published: (2018)