Abstract
We introduced an approach to parallel computing which unites the automatic and direct programming paradigms within the core BSPlib environment. Our PRAM simulator and companion C++ macro-based language[LS96] is scalable and portable; it has been tested on the IBM SP2, Cray T3D, SGI Power challenge, and a cluster of Sun Workstations. Directly-programmed solutions to regular problems inevitably can obtain greater performance than our simulator. Our approach wins for irregular problems with poor locality.
This is a preview of subscription content, log in via an institution to check access.
References
A. V. Gerbessiotis and L. G. Valiant. Direct bulk-synchronous parallel algorithms. Journal of Parallel and Distributed Computing, 22:251–267, 1994.
D. S. Lecomber and K. R. Sujithan. Transgressing the boundaries: Unified scalable parallel programming. Technical Report PRG-TR-20-96, Oxford University Computing Laboratory, November 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lecomber, D.S., Sujithan, K.R., Hill, J.M.D. (1997). Architecture-independent locality analysis and efficient PRAM simulations. In: Hertzberger, B., Sloot, P. (eds) High-Performance Computing and Networking. HPCN-Europe 1997. Lecture Notes in Computer Science, vol 1225. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0031674
Download citation
DOI: https://doi.org/10.1007/BFb0031674
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62898-9
Online ISBN: 978-3-540-69041-2
eBook Packages: Springer Book Archive