Minimizing completion time for loop tiling with computation and communication overlapping

Citations Over TimeTop 10% of 2002 papers

Abstract

This paper proposes a new method for the problem of minimizing the execution time of nested for-loops using a tiling transformation. In our approach, we are interested not only in tile size and shape according to the required communication to computation ratio, but also in overall completion time. We select a time hyperplane to execute different tiles much more efficiently by exploiting the inherent overlapping between communication and computation phases among successive, atomic tile executions. We assign tiles to processors according to the tile space boundaries thus considering the iteration space bounds. Our schedule considerably reduces overall completion time under the assumption that some part from every communication phase can be efficiently overlapped with atomic, pure tile computations. The overall schedule resembles a pipelined datapath where computations are not anymore interleaved with sends and receives to non-local processors. Experimental results in a cluster of Pentiums by using various MPI send primitives show that the total completion time is significantly reduced.

Related Papers

• → Parametric multi-level tiling of imperfectly nested loops(2009)82 cited
• → Tiling Imperfectly-nested Loop Nests(2000)31 cited
• → Mapping Imperfect Loops to Coarse-Grained Reconfigurable Architectures(2015)2 cited
• Tiling Imperfectly-nested Loop Nests (REVISED)(2000)
• Tiling Imperfectly-nested Loops(1999)