Answers are grounded in this paper and cite their sources.
For 2-D iteration space tiling, we address the problem of determining the tile parameters that minimize the total execution time under the BSP model. We consider uniform dependency computations, tiled so that (at least) one of the tile boundaries is parallel to the domain boundary. We determine the optimal tile size as a closed form solution. In addition, we determine the optimal number of processors and also the optimal slope of the oblique tile boundary.
No takes yet. Share an insight, caveat, or question.
Andonov et al. (2001) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: