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

Abstract

In this pape6 we deal with n ~ o geometric problems arising froin heterogeneous parallel computing: how to partition the unit square irito p rectangles of given area SI, sa, . . . sp (such that E:='=, s = l), so as to minimize (i) either the sum of the p perimeters of the rectangles (i i) or the largest perimeter of the p rectangles. For both problems, we… (More)
DOI: 10.1109/EMPDP.2001.905056

Topics

6 Figures and Tables

Cite this paper

@inproceedings{Beaumont2001HeterogeneousMM, title={Heterogeneous Matrix-Matrix Multiplication or Partitioning a Square into Rectangles: NP-Completeness and Approximation Algorithms}, author={Olivier Beaumont and Vincent Boudet and Arnaud Legrand and Fabrice Rastello and Yves Robert}, booktitle={PDP}, year={2001} }