BSPlib: The BSP programming library

Parallel Computing

Volumn 24, Issue 14, 1998, Pages 1947-1980

  Hill, Jonathan M D ^a   McColl, Bill ^a   Stefanescu, Dan C ^e   Goudreau, Mark W ^b   Lang, Kevin ^e   Rao, Satish B ^e   Suel, Torsten ^e   Tsantilas, Thanasis ^c   Bisseling, Rob H ^d  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF CENTRAL FLORIDA   (United States)

^c Och Spine at New York Presbyterian Hospitals   (United States)

^d UTRECHT UNIVERSITY   (Netherlands)

^e NONE

Author keywords

Bulk synchronous parallel; One sided communication; Parallel communications library

Indexed keywords

BENCHMARKING; C (PROGRAMMING LANGUAGE); COMPUTER ARCHITECTURE; DATA COMMUNICATION SYSTEMS; DATA STORAGE EQUIPMENT; FAST FOURIER TRANSFORMS; MOLECULAR DYNAMICS; SORTING;

BULK SYNCHRONOUS MESSAGE PASSING (BSMP); BULK SYNCHRONOUS PARALLEL (BSP) PROGRAMMING; DIRECT REMOTE MEMORY ACCESS (DRMA); PARALLEL COMMUNICATIONS LIBRARY;

PARALLEL PROCESSING SYSTEMS;

EID: 0032297719     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(98)00093-3     Document Type: Article

References (42)

1. A.W. Appel, An efficient program for many-body simulation, SIAM Journal on Scientific and Statistical Computing 6 (1) (1985) 85-103.
2. J. Barnes, P. Hut, A hierarchical O(N log N) force-calculation algorithm, Nature 324 (1986) 446-449.
3. R. Barriuso, A. Knies, SHMEM User's Guide, Revision 2.0, Cray Research Inc., Mendota Heights, MN, May 1994.
4. R.H. Bisseling, Sparse matrix computations on bulk synchronous parallel computers, in: G. Alefeld, O. Mahrenholtz, R. Mennicken (Eds.), ICIAM '95. Issue 1. Numerical Analysis, Scientific Computing, Computer Science, Akademie, Berlin, 1996, pp. 127-130.
5. R.H. Bisseling, Basic techniques for numerical linear algebra on bulk synchronous parallel computers, in: L. Vulkov, J. Waśniewski, P. Yalamov (Eds.), Workshop Numerical Analysis and its Applications 1996, Lecture Notes in Computer Science, vol. 1196, Springer, Berlin, 1997, pp. 46-57.
6. R.H. Bisseling, W.F. McColl, Scientific computing on bulk synchronous parallel architectures, in: B. Pehrson, I. Simon (Eds.), Technology and Foundations: Information Processing'94, vol. I, IFIP Transactions A, vol. 51, Elsevier, Amsterdam, 1994, pp. 509-514.
7. D. Blackston, T. Suel, Highly portable and efficient implementations of parallel adaptive N-body methods, in: Supercomputing'97, November 1997.
8. G.E. Blelloch, C.E. Leiserson, B.M. Maggs, C.G. Plaxton, S.J. Smith, M. Zagha, A comparison of sorting algorithms on the connection machine CM-2, in: Third Annual ACM Symposium on Parallel Algorithms and Architectures, 1991, pp. 3-16.
9. T. Cheatham, A. Fahmy, D.C. Stefanescu, L.G. Valiant, Bulk synchronous parallel computing - a paradigm for transportable software, in: 28th Hawaii International Conference on System Science, vol. II, IEEE Computer Society Press, Silver Spring, MD, January 1995, pp. 268-275.
10. D. Culler, A. Dusseau, S. Goldstein, A. Krishnamurthy, S. Lumetta, T. von Eicken, K. Yelick, Parallel programming in Split-C, in: Supercomputing '93, November 1993.
11. D. Culler, R. Karp, D. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, T. von Eicken, LogP: towards a realistic model of parallel computation, in: Fourth ACM Symposium on Principles and Practice of Parallel Programming, May 1993, pp. 1-12.
12. S.R. Donaldson, J.M.D. Hill, D.B. Skillicorn, Predictable communication on unpredictable networks: implementing BSP over TCP/IP, in: EuroPar'98, Southampton, UK, September 1998, Lecture Notes in Computer Science, Springer, Berlin.
13. A.C. Dusseau, D.E. Culler, K.E. Schauser, R.P. Martin, Fast parallel sorting under LogP: experience with the CM-5, IEEE Transactions on Parallel and Distributed Systems 7 (8) (1996) 791-805.
14. W.D. Frazer, A.C. McKellar, Samplesort: a sampling approach to minimal storage tree sorting, Journal of the ACM 17 (3) (1970) 496-507.
15. A.V. Gerbessiotis, L.G. Valiant, Direct bulk-synchronous parallel algorithms, Journal of Parallel and Distributed Computing 22 (2) (1994) 251-267.
16. M.W. Goudreau, K. Lang, S.B. Rao, T. Suel, T. Tsantilas, Towards efficiency and portability: programming with the BSP model, in: Eighth Annual ACM Symposium on Parallel Algorithms and Architectures, June 1996, pp. 1-12.
17. M.W. Goudreau, K. Lang, S.B. Rao, T. Tsantilas, The Green BSP Library, Technical Report CS-TR-95-11, Department of Computer Science, University of Central Florida, Orlando, FL, June 1995.
18. L. Greengard, V. Rokhlin, A fast algorithm for particle simulations, Journal of Computational Physics 73 (2) (1987) 325-348.
19. W. Gropp, E. Lusk, A. Skjellum, Using MPI: Portable Parallel Programming with the Message-Passing Interface, MIT Press, Cambridge, MA, 1994.
20. W.L. Hightower, J.F. Prins, J.H. Reif, Implementations of randomized sorting on large parallel machines, in: Fourth Annual ACM Symposium on Parallel Algorithms and Architectures, June 1992, pp. 158-167.
21. J.M.D. Hill, P.I. Crumpton, D.A. Burgess, Theory, practice, and a tool for BSP performance prediction, in: EuroPar '96, Lecture Notes in Computer Science, vol. 1124, Springer, Berlin, August 1996, pp. 697-705.
22. J.M.D. Hill, S. Donaldson, D. Skillicorn, Stability of communication performance in practice: from the Cray T3E to Networks of Workstations, Technical Report PRG-TR-33-97, Programming Research Group, Oxford University Computing Laboratory, October 1997.
23. J.M.D. Hill, S.R. Donaldson, D.B. Skillicorn, Portability of performance with the BSPlib communications library, in: Programming Models for Massively Parallel Computers (MPPM'97), London, November 1997, IEEE Computer Society Press, Silver Spring, MD.
24. J.M.D. Hill, B. McColl, D.C. Stefanescu, M.W. Goudreau, K. Lang, S.B. Rao, T. Suel, T. Tsantilas, R. Bisseling, BSPlib: The BSP Programming Library, Technical Report PRG-TR-29-9, Oxford University Computing Laboratory, Oxford, UK, May 1997. See www.bsp-worldwide.org for more details.
25. J.M.D. Hill, D. Skillicorn, Lessons learned from implementing BSP, Future Generation Computer Systems 13 (4/5) (1998) 327-335.
26. C.A.R. Hoare, Quicksort, Computer Journal 5 (1) (1962) 10-15.
27. J.S. Huang, Y.C. Chow, Parallel sorting and data partitioning by sampling, in: Seventh International Computer Software and Applications Conference (COMPSAC'83), IEEE Computer Society, November 1983, pp. 627-631.
28. B.H.H. Juurlink, H.A.G. Wijshoff, A quantitative comparison of parallel computation models, in: Eighth Annual ACM Symposium on Parallel Algorithms, and Architectures,June 1996, pp. 13-24.
29. P. Liu, S.N. Bhatt, Experiences with parallel N-body simulations, in: Sixth Annual ACM Symposium on Parallel Algorithms and Architectures, 1994, pp. 122-131.
30. W.F. McColl, Scalable computing, in: J. van Leeuwen (Ed.), Computer Science Today: Recent Trends and Developments, Lecture Notes in Computer Science, vol. 1000, Springer, Berlin, 1995, pp. 46-61.
31. W.F. McColl, Scalability, portability and predictability: the BSP approach to parallel programming, Future Generation Computer Systems 12 (4) (1996) 265-272.
32. R. Miller, A library for bulk synchronous parallel programming, in: Proceedings of The BCS Parallel Processing Specialist Group Workshop on General Purpose Parallel Computing, December 1993, pp. 100-108.
33. P.B. Monk, A.K. Parrott, P.J. Wesson, A parallel finite element method for electro-magnetic scattering, COMPEL 13 (Supp. A) (1994) 237-242.
34. MPI: A Message Passing Interface, version 2.0, Message Passing Interface Forum, July 1997.
35. C.H. Papadimitriou, M. Yannakakis, Towards an architecture-independent analysis of parallel algorithms, in: 20th ACM Symposium on Theory of Computing, ACM, 1998, pp. 510-513.
36. J.H. Reif, L.G. Valiant, A logarithmic time sort for linear size networks, Journal of the ACM 34 (1) (1987) 60-76.
37. G. Shumaker, M.W. Goudreau, Bulk-synchronous parallel computing on the Maspar, in: World Multiconference on Systemics, Cybernetics and Informatics, vol. 1, July 1997, pp. 475-481.
38. D. Skillicorn, J.M.D. Hill, W.F. McColl, Questions and answers about BSP, Scientific Programming 6 (3) (1997) 249-274.
39. L.G. Valiant, A bridging model for parallel computation, Communications of the ACM 33 (8) (1990) 103-111.
40. C. Van Loan, Computational Frameworks for the Fast Fourier Transform, Frontiers in Applied Mathematics, vol. 10, SIAM, Philadelphia, PA, 1992.
41. M.S. Warren, J.K. Salmon, Astrophysical N-body simulations using hierarchical tree data structures, in: Supercomputing'92, 1992, pp. 570-576.
42. F. Zhao, An O(N) algorithm for three-dimensional N-body simulations, Technical Report, Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, October 1987.