Abstract.
The model of bulk-synchronous parallel (BSP) computation is an emerging paradigm of general-purpose parallel computing. Its modification, the BSPRAM model, allows one to combine the advantages of distributed and shared-memory style programming. In this paper we study the BSP memory complexity of matrix multiplication. We propose new memory-efficient BSP algorithms both for standard and for fast matrix multiplication. The BSPRAM model is used to simplify the description of the algorithms. The communication and synchronization complexity of our algorithms is slightly higher than that of known time-efficient BSP algorithms. The current time-efficient and new memory-efficient algorithms are connected by a continuous tradeoff.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received June 1, 1997; revised March 10, 1998.
Rights and permissions
About this article
Cite this article
McColl, W., Tiskin, A. Memory-Efficient Matrix Multiplication in the BSP Model . Algorithmica 24, 287–297 (1999). https://doi.org/10.1007/PL00008264
Issue Date:
DOI: https://doi.org/10.1007/PL00008264