Cuboid Partitioning for Parallel Matrix Multiplication on Heterogeneous Platforms

The problem of partitioning a square into zones of prescribed areas arises when partitioning matrices for dense linear algebra kernels onto a set of heterogeneous processors, and several approximation algorithms have been proposed for that problem. In this paper, we address the natural generalization of this problem in dimension 3: partition a cuboid in a set of zones of prescribed volumes (which represent the amount of computations to perform), while minimizing the surface of the boundaries between zones (which represent the data transfers involved). This problem naturally arises in the context of matrix multiplication, and can be seen as a heterogeneous generalization of 2.5D approaches that have been proposed in this context. The contributions of this paper are twofold. We prove the NP-completeness of the general problem, and we propose a 5/6^(2/3) (~1.51) approximation algorithm for cube-partitioning. This is the first known approximation result for this 3D partitioning problem.Solveurs pour architectures hétérogènes utilisant des supports d'exécutio