2000 character limit reached
Fusion of Array Operations at Runtime (1601.05400v2)
Published 20 Jan 2016 in cs.DC and cs.PL
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.