Automatic construction of sparse data flow evaluation graphs
Jong-Deok Choi, Ron Cytron, et al.
POPL 1991
The ability to represent, manipulate and optimize data movement between devices such as processors in a distributed memory machine, or between global memory and processors in a shared memory machine, is crucial in generating efficient code for such machines. In this paper we describe a methodology for representing and manipulating data movement explicitly in a compiler. Our methodology, called Explicit Data Placement 1993, consists of extensions to the compiler's intermediate program language, as well as run-time structures that allow certain operations to be performed efficiently. We also illustrate one of the unique features of the XDP methodology: the ability to manipulate the run-time transfer of data ownership between processors. © 1993, ACM. All rights reserved.
Jong-Deok Choi, Ron Cytron, et al.
POPL 1991
Wolfgang Richter, Canturk Isci, et al.
IC2E 2014
Larry Carter, Robert Floyd, et al.
STOC 1978
Frances Allen, Michael Burke, et al.
Journal of Parallel and Distributed Computing