Optimal evaluation of array expressions on massively parallel machinesWe investigate the problem of evaluating FORTRAN 90 style array expressions on massively parallel distributed-memory machines. On such machines, an elementwise operation can be performed in constant time for arrays whose corresponding elements are in the same processor. If the arrays are not aligned in this manner, the cost of aligning them is part of the cost of evaluating the expression. The choice of where to perform the operation then affects this cost. We present algorithms based on dynamic programming to solve this problem efficiently for a wide variety of interconnection schemes, including multidimensional grids and rings, hypercubes, and fat-trees. We also consider expressions containing operations that change the shape of the arrays, and show that our approach extends naturally to handle this case.
Document ID
19930050574
Acquisition Source
Legacy CDMS
Document Type
Conference Paper
Authors
Chatterjee, Siddhartha (Research Inst. for Advanced Computer Science; NASA, Ames Research Center Moffett Field, CA, United States)
Gilbert, John R. (Xerox Palo Alto Research Center CA, United States)
Schreiber, Robert (Research Inst. for Advanced Computer Science; NASA, Ames Research Center Moffett Field, CA, United States)
Teng, Shang-Hua (MIT Cambridge, MA, United States)