Issue No. 12 - December (2002 vol. 13)
<p><b>Abstract</b>—With the objective of minimizing the total execution time of a parallel program on a distributed memory parallel computer, this paper discusses the selection of an optimal supernode shape of a supernode transformation (also known as tiling). We identify three parameters of a supernode transformation: supernode size, relative side lengths, and cutting hyperplane directions. For supernode transformations on algorithms with perfectly nested loops and uniform dependencies, we prove the optimality of a constant linear schedule vector and give a necessary and sufficient condition for optimal relative side lengths. We also prove that the total running time is minimized by a cutting hyperplane direction matrix from a particular subset of all valid directions and we discuss the cases where this subset is unique. The results are derived in continuous space and should be considered approximate. Our model does not include cache effects and assumes an unbounded number of available processors, the communication cost approximated by a constant, uniform dependences, and loop bounds known at compile time. A comprehensive example is discussed with an application of the results to the Jacobi algorithm.</p>
Supernode transformation, tiling, algorithm partitioning, parallelizing compilers, minimizing running time, distributed memory multicomputer.
Weijia Shang, Edin Hodzic, "On Time Optimal Supernode Shape", IEEE Transactions on Parallel & Distributed Systems, vol. 13, no. , pp. 1220-1233, December 2002, doi:10.1109/TPDS.2002.1158261