A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
StencilFlow: Mapping Large Stencil Programs to Distributed Spatial Computing Systems
[article]
2021
arXiv
pre-print
Spatial computing devices have been shown to significantly accelerate stencil computations, but have so far relied on unrolling the iterative dimension of a single stencil operation to increase temporal locality. This work considers the general case of mapping directed acyclic graphs of heterogeneous stencil computations to spatial computing systems, assuming large input programs without an iterative component. StencilFlow maximizes temporal locality and ensures deadlock freedom in this
arXiv:2010.15218v2
fatcat:kev77kpks5abhjjgosqidjfdki