2000 character limit reached
Fusion of Array Operations at Runtime
Published 20 Jan 2016 in cs.DC and cs.PL | (1601.05400v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
