Memory-efficient matrix multiplication in the BSP model

Algorithmica (New York)

Volumn 24, Issue 3-4, 1999, Pages 287-297

  McColl, W F ^a   Tiskin, A ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

BSP; Bulk synchronous parallel computation; Memory efficiency; Parallel matrix multiplication

Indexed keywords

EID: 0000743020     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00008264     Document Type: Article

References (16)

1. R. C. Agarwal et al. A three-dimensional approach to parallel matrix multiplication. IBM Journal of Research and Development, 39(5):575-581, 1995.
2. A. Aggarwal, A. K. Chandra, and M. Snir. Communication complexity of PRAMs. Theoretical Computer Science, 71:3-28, 1990.
3. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9(3):251-280, March 1990.
4. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. The MIT Electrical Engineering and Computer Science Series. The MIT Press, Cambridge, MA, and McGraw-Hill, New York, 1990.
5. B. Grayson and R. A. van de Geijn. A high performance parallel Strassen implementation. Parallel Processing Letters, 6(1):3-12, 1996.
6. S. K. S. Gupta, C.-H. Huang, P. Saddayappan, and R. W. Johnson. A framework for generating distributed-memory parallel programs for block recursive algorithms. Journal of Parallel and Distributed Computing, 34:137-153, 1996.
7. J. M. D. Hill, P. I. Crumpton, and D. A. Burgess. Theory, practice and a tool for BSP performance prediction. In L. Bougé, P. Fraigniaud, A. Mignotte, and Y. Robert, editors, Proceedings of Euro-Par '96 (II), volume 1124 of Lecture Notes in Computer Science, pages 697-705. Springer-Verlag, Berlin, 1996.
8. J. E. Hopcroft and L. R. Kerr. On minimizing the number of multiplications necessary for matrix multiplication. SIAM Journal of Applied Mathematics, 20(1):30-36, January 1971.
9. B. Kumar, C.-H. Huang, P. Saddayappan, and R. W. Johnson. A tensor product formulation of Strassen's matrix multiplication algorithm with memory reduction. Scientific Programming, 4(4):275-289, 1995.
10. W. F. McColl. General purpose parallel computing. In A. Gibbons and P. Spirakis, editors, Lectures on Parallel Computation, volume 4 of Cambridge International Series on Parallel Computation, chapter 13, pages 337-391. Cambridge University Press, Cambridge, 1993.
11. W. F. McColl. Scalable computing. In J. van Leeuwen, editor, Computer Science Today: Recent Trends and Developments, volume 1000 of Lecture Notes in Computer Science, pages 46-61. Springer-Verlag, Berlin, 1995.
12. W. F. McColl. A BSP realisation of Strassen's algorithm. In M. Kara, J. R. Davy, D. Goodeve, and J. Nash, editors, Abstract Machine Models for Parallel and Distributed Computing. IOS Press, Amsterdam, 1996.
13. W. F. McColl. Universal computing. In L. Bougé, P. Fraigniaud, A. Mignotte, and Y. Robert, editors, Proceedings of Euro-Par' 96 (I), volume 1123 of Lecture Notes in Computer Science, pages 25-36. Springer-Verlag, Berlin, 1996.
14. V. Strassen. Gaussian elimination is not optimal. Numerische Mathematik, 13:354-356, 1969.
15. A. Tiskin. The bulk-synchronous parallel random access machine. Theoretical Computer Science, 136(1-2):109-130, 1998.
16. L. G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103-111, August 1990.