Fusion of Array Operations at Runtime
Reviewed by Pithpith:IXVQUNHHopen to challenge →
classification
cs.DC
cs.PL
keywords
fusionproblemarrayoperationsaddresscombinatorcommunicationcompatibility
read the original abstract
We address the problem of fusing array operations based on criteria such as shape compatibility, data reusability, and communication. We formulate the problem as a graph partition problem that is general enough to handle loop fusion, combinator fusion, and other types of subroutines.
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.