Heterogeneous matrix-matrix multiplication or partitioning a square into rectangles: NP-completeness and approximation algorithms

Proceedings - 9th Euromicro Workshop on Parallel and Distributed Processing, PDP 2001

Volumn , Issue , 2001, Pages 298-305

  Beaumont, O ^a   Boudet, V ^a   Legrand, A ^a   Rastello, F ^a   Robert, Y ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GEOMETRY;

GEOMETRIC PROBLEMS; HETEROGENEOUS PARALLEL COMPUTING; MATRIX MATRIX MULTIPLICATIONS; NP-COMPLETENESS; UNIT SQUARES;

APPROXIMATION ALGORITHMS;

EID: 84963626751     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/EMPDP.2001.905056     Document Type: Conference Paper

References (15)

1. N. Alon and D. Kleitman. Covering a square by small perimeter rectangles. Discrete Computational Geometry, 1:1-7, 1986.
2. O. Beaumont, V. Boudet, F. Rastello, and Y. Robert. Matrix-matrix multiplication on heterogeneous platforms. Technical Report RR-2000-02, LIP, ENS Lyon, Jan. 2000. Short version appears in the proceedings of ICPP'2000.
3. O. Beaumont, V. Boudet, F. Rastello, and Y. Robert. Partitioning a square into rectangles: NP-completeness and approximation algorithms. Technical Report RR-2000-10, LIP, ENS Lyon, Feb. 2000.
4. L. S. Blackford, J. Choi, A. Cleary, E. D'Azevedo, J. Demmel, I. Dhillon, J. Dongarra, S. Hammarling, G. Henry, A. Petitet, K. Stanley, D. Walker, and R. C. Whaley. ScaLAPACK Users' Guide. SIAM, 1997.
5. P. Crandall and M. Quinn. Block data decomposition for data-parallel programming on a heterogeneous workstation network. In 2nd International Symposium on High Performance Distributed Computing, pages 42-49. IEEE Computer Society Press, 1993.
6. T. Gonzalez and S. Zheng. Improved bounds for rectangular and guilhotine partitions. J. Symbolic Computation, 7:591-610, 1989.
7. T. Gonzalez and S. Zheng. Approximation algorithm for partitioning a rectangle with interior points. Algorithmica, 5:1 1-42, 1990.
8. M. Kaddoura, S. Ranka, and A. Wang. Array decomposition for nonuniform computational environments. Journal of Parallel and Distributed Computing, 36:91-105, 1996.
9. A. Kalinov and A. Lastovetsky. Heterogeneous distribution of computations while solving linear algebra problems on networks of heterogeneous computers. In P. Sloot, M. Bubak, A. Hoekstra, and B. Hertzberger, editors, HPCN Europe 1999, LNCS 1593, pages 191-200. Springer Verlag, 1999.
10. S. Khanna, S. Muthukrishnan, and M. Paterson. On approximating rectangle tiling and packing. In Proc. 9th Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 384-393. ACM Press, 1998.
11. S. Khanna, S. Muthukrishnan, and S. Skiena. Efficient array partitioning. In Proc. 24th Int. Colloquium on Automata, Languages and Programming, LNCS 1256, pages 616-626. Springer-Verlag, 1997.
12. T. Kong, D. Mount, and W. Roscoc. The decomposition of a rectangle into rectangles of minimal perimeter. SIAM J. Computing, 17(6): 1215-1231, 1988.
13. T. Kong, D. Mount, and M. Wermann. The decomposition of a square into rectangles of minimal perimeter. Discrete Applied Mathematics, 16:239-243, 1987.
14. A. Lingas, R. Pinter, R. Rivest, and A. Shamir. Minimum edge length partitioning of rectilinear polygons. In Proc. 20th Ann. Allerton Conference on Communication, Control and Computing, 1982.
15. F. Pastello. Partitionnement et distribution des données: des nids de boucles à l'algorithmique hétérogène. PhD thesis, Ecole Normale Supérieure de Lyon, Sept. 2000.