Global optimization of operand transfer fusion in heterogeneous computing

Abstract

We consider the problem of minimizing, for a dataflow graph of kernel calls, the overall number of operand data transfers, and thus, the accumulated transfer startup overhead, in heterogeneous systems with non-shared memory. Our approach analyzes the kernel-operand dependence graph and reorders the operand arrays in memory such that transfers and memory allocations of multiple operands adjacent in memory can be merged, saving transfer startup costs and memory allocation overheads. CCS CONCEPTS • Computer systems organization → Heterogeneous (hybrid) systems; • Software and its engineering → Communications management; Compilers.