Abstract
The model of bulk-synchronous parallel (BSP) computation is intended to provide a simple and realistic framework for general-purpose parallel computing. Originally, BSP was defined as a distributed memory model. In this paper we present a new model, called BSPRAM, which is a variant of BSP based on a mixture of shared and distributed memory. The two models are equivalent for some important classes of algorithms. We identify two such classes: oblivious and coarse-block algorithms. Finally, we present BSPRAM algorithms for dense matrix multiplication and Fast Fourier Transform.
This work was supported in part by ESPRIT Basic Research Project 9072 — GEPPCOM (Foundations of General Purpose Parallel Computing).
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
A Aggarwal, A K Chandra, and M Snir. Communication complexity of PRAMs. Theoretical Computer Science, 71:3–28, 1990.
C Berge. Graphs, volume 6, part 1 of North-Holland Mathematical Library. North-Holland, second revised edition, 1985.
D Coppersmith and S Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9:251–280, 1990.
T H Cormen, C E Leiserson, and R L Rivest. Introduction to Algorithms. The MIT Electrical Engineering and Computer Science Series. The MIT Press and McGraw-Hill, 1990.
A V Gerbessiotis and L G Valiant. Direct bulk-synchronous parallel algorithms. Technical Report TR-10-92 (Extended version), Aiken Computation Laboratory, Harvard University, 1992. Shorter version appears in Proc. 3rd Scandinavian Workshop on Algorithm Theory, July 8–10, 1992, LNCS Vol. 621, pp. 1–18, Springer-Verlag.
M Goodrich. Communication-efficient parallel sorting. In Proceedings of the 28th ACM Symp. on Theory of Computing (May 1996).
J JáJá. An Introduction to Parallel Algorithms. Addison-Wesley, 1992.
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, 1993.
W F McColl. Special 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 261–336. Cambridge University Press, 1993.
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, 1995.
C H Papadimitriou and M Yannakakis. Towards an architecture-independent analysis of parallel algorithms. In Proceedings of the 20th Annual Symposium on Theory of Computing, pages 510–513, 1988.
V Strassen. Gaussian elimination is not optimal. Numerische Mathematik, 13:354–356, 1969.
L G Valiant. Bulk-synchronous parallel computers. In M Reeve, editor, Parallel Processing and Artificial Intelligence, chapter 2, pages 15–22. John Wiley & Sons, 1989.
L G Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103–111, August 1990.
L G Valiant. General purpose parallel architectures. In J van Leeuwen, editor, Handbook of Theoretical Computer Science, chapter 18, pages 943–971. Elsevier, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tiskin, A. (1996). The bulk-synchronous parallel random access machine. In: Bougé, L., Fraigniaud, P., Mignotte, A., Robert, Y. (eds) Euro-Par'96 Parallel Processing. Euro-Par 1996. Lecture Notes in Computer Science, vol 1124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024720
Download citation
DOI: https://doi.org/10.1007/BFb0024720
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61627-6
Online ISBN: 978-3-540-70636-6
eBook Packages: Springer Book Archive