Abstract
The bsp model was proposed as a step towards general purpose parallel computing. This paper introduces the e-bsp model that extends the bsp model in two ways. First, it provides a way to deal with unbalanced communication patterns, i.e., communication patterns in which the amount of data sent or received by each processor is different. Second, it adds a notion of general locality to the bsp model where the delay of a remote memory access depends on the relative location of the processors in the interconnection network. We use our model to develop several algorithms that improve upon algorithms derived under the bsp model.
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
G. Chochia, M. Cole, and T. Heywood. Implementation of the Hierarchical PRAM on the 2D Mesh: Analysis and Experiments. In Symp. on Parallel and Distributed Processing. IEEE, Oct. 1995.
P. de la Torre and C.P. Kruskal. Towards a Single Model of Efficient Computation in Real Parallel Machines. In PARLE '91, pages 7–24. Springer, 1991. LNCS 505.
T. Heywood and C. Leopold. Dynamic Randomized Simulation of Hierarchical PRAMs on Meshes. In Aizu International Symposium on Parallel Algorithm/Architecture Synthesis, March 1995.
T. Heywood and S. Ranka. A Practical Hierarchical Model of Parallel Computation I: The Model. Journal of Parallel and Distributed Computing, 16:212–232, 1992.
B.H.H. Juurlink and H.A.G. Wijshoff. The E-BSP Model: Incorporating Unbalanced Communication and General Locality into the BSP Model. Technical Report 95-44, Leiden University, 1995.
B.H.H. Juurlink and H.A.G. Wijshoff. A Quantitative Comparison of Parallel Computation Models. In Proc. 8th Symp. on Parallel Algorithms and Architectures, 1996. To appear.
B.H.H. Juurlink and H.A.G. Wijshoff. Communication Primitives for BSP Computers. Inf. Proc. Letters, 1996. To appear.
C. Kaklamanis and G. Persiano. Branch-and-Bound and Backtrack Search on Mesh-Connected Arrays of Processors. In Proc. 4th Symp. on Parallel Algorithms and Architectures, pages 118–126. ACM, 1992.
W.F. McColl. General Purpose Parallel Computing. In A. Gibbons and P. Spirakis, editors, Lectures on Parallel Computation, chapter 13. Cambridge University Press, 1993.
W.F. McColl. Scalable Computing. In Computer Science Today: Recent Trends and Developments. Springer, 1995. LNCS 1000.
D. Peleg and E. Upfal. The Generalized Packet Routing Problem. Theoretical Comp. Sci., 53:281–293, 1987.
J.F. Sibeyn. Algorithms for Routing on Meshes. PhD thesis, Utrecht University, 1992.
J.F. Sibeyn and M. Kaufmann. Deterministic 1-k Routing on Meshes, With Applications to Worm-Hole Routing. Technical Report MPI-I-93-163, Max-Planck-Institut für Informatik, 1993.
H.J. Siegel, S. Abraham, and W.L. Bain et al. Report of the Purdue Workshop on Grand Challenges in Computer Architecture for the Support of High Performance Computing. Journal of Parallel and Distributed Computing, 16:199–211, 1992.
L.G. Valiant. A Bridging Model for Parallel Computation. Communications of the ACM, 33(8), 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Juurlink, B.H.H., Wijshoff, H.A.G. (1996). The E-BSP model: Incorporating general locality and unbalanced communication into the BSP model. 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/BFb0024721
Download citation
DOI: https://doi.org/10.1007/BFb0024721
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