paper

Fusion of Array Operations at Runtime

arXiv:1601.05400 · doi:10.1145/2967938.2967945

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.

Preprint

References in corpus (1)

Cited by in corpus (2)