Heterogeneous Matrix-Matrix Multiplication, or Partitioning a Square into Rectangles: NP-Completeness and Approximation Algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2001

Heterogeneous Matrix-Matrix Multiplication, or Partitioning a Square into Rectangles: NP-Completeness and Approximation Algorithms

Vincent Boudet
Arnaud Legrand
Fabrice Rastello
Yves Robert

Résumé

In this paper, we deal with two geometric problems arising from heterogeneous parallel computing: how to partition the unit square into p rectangles of given area s1, s2, ..., sp (such that Σi=1p si=1), so as to minimize (i) either the sum of the p perimeters of the rectangles (ii) or the largest perimeter of the p rectangles. For both problems, we prove NP-completeness and we introduce approximation algorithms

Dates et versions

hal-00789461 , version 1 (18-02-2013)

Identifiants

Citer

Olivier Beaumont, Vincent Boudet, Arnaud Legrand, Fabrice Rastello, Yves Robert. Heterogeneous Matrix-Matrix Multiplication, or Partitioning a Square into Rectangles: NP-Completeness and Approximation Algorithms. EuroMicro Workshop on Parallel and Distributed Computing (EuroMicro\'2001), 2001, Unknown, pp.298―305, ⟨10.1109/EMPDP.2001.905056⟩. ⟨hal-00789461⟩
117 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More