Abstract
The Bulk-Synchronous Parallel (BSP) model of computation reflects the capabilities and costs of communication on a wide range of general-purpose parallel architectuers. Thus it allows general-purpose parallel software and hardware to be developed independently of one another; much as the von Neumann model provides the same facility for sequential computation. This paper presents a simple programming notation for shared-memory programming, based upon BSP constructs. The notation is defined formally by its effect upon process states. Algebraic laws are given which allow program derivation. A further set of laws allow transformation of finite programs to a normal form.
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
R. H. Bisseling and W. F. McColl: Scientific Computing on Bulk Synchronous Parallel Architectures. Technical Report 836, Department of Mathematics, University of Utrecht, December 1993.
T. Cheatham, A. Fahmy, D. C. Stefanescu, and L. G. Valiant: Bulk Synchronous Parallel Computing — A Paradigm for Transportable Software. Technical Report TR-36-94, Harvard University, Computer Science Department, 1994.
C. A. R. Hoare, I. J. Hayes, J. He, C. C. Morgan, A. W. Roscoe, J. W. Sanders, I. H. SØrensen, J. M. Spivey, and B. A. Sufrin: Laws of Programming. Communications of the ACM, 30(8):672–687, August 1987. see Corrigenda in Communications of the ACM, 30(9): 770.
W. F. McColl: General Purpose Parallel Computing. In A. M. Gibbons and P. Spirakis, editors, Lectures on Parallel Computation. Proc. 1991 ALCOM Spring School on Parallel Computation, pages 337–391. Cambridge University Press, 1993.
W. F. McColl: BSP Programming. In G. Blelloch, M. Chandy, and S. Jagannathan, editors, Proc. DIMACS Workshop on Specification of Parallel Algorithms, Princeton, May 1994. American Mathematical Society.
Leslie G. Valiant: A bridging model for parallel computation. Communications of the ACM, 33(8):103–111, August 1990.
Leslie G. Valiant: BSP Computing. Technical report, Harvard University, Computer Science Department, January 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jifeng, H., Miller, Q., Chen, L. (1996). Algebraic laws for BSP programming. 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/BFb0024724
Download citation
DOI: https://doi.org/10.1007/BFb0024724
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