BSPlib: The BSP Programming Library

BSPlib: The BSP Programming Library (1998)

Cached

Download Links

[cis.poly.edu]
[ftp.cs.ucf.edu]
[www.neci.nj.nec.com]

Other Repositories/Bibliography

DBLP

by Jonathan M. D. Hill , Bill McColl , Dan C. Stefanescu , Mark W. Goudreau , Kevin Lang , Satish B. Rao , Torsten Suel , Thanasis Tsantilas , Rob H. Bisseling

Citations:

89 - 6 self

BibTeX

@MISC{Hill98bsplib:the,
    author = {Jonathan M. D. Hill and Bill McColl and Dan C. Stefanescu and Mark W. Goudreau and Kevin Lang and Satish B. Rao and Torsten Suel and Thanasis Tsantilas and Rob H. Bisseling},
    title = {BSPlib: The BSP Programming Library},
    year = {1998}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

BSPlib is a small communications library for bulk synchronous parallel (BSP) programming which consists of only 20 basic operations. This paper presents the full definition of BSPlib in C, motivates the design of its basic operations, and gives examples of their use. The library enables programming in two distinct styles: direct remote memory access using put or get operations, and bulk synchronous message passing. Currently, implementations of BSPlib exist for a variety of modern architectures, including massively parallel computers with distributed memory, shared memory multiprocessors, and networks of workstations. BSPlib has been used in several scientific and industrial applications; this paper briefly describes applications in benchmarking, Fast Fourier Transforms, sorting, and molecular dynamics.

Citations

1174	A bridging model for parallel computation - Valiant - 1990 (Show Context) Citation Context ...ore di#cult than for sequential programs. Recent research on Bulk Synchronous Parallel (BSP) algorithms, architectures and languages has shown that the BSP model can achieve all of these requirements =-=[7, 3, 6, 2, 1, 5]-=-. The BSP model decouples the two fundamental aspects of parallel computation, communication and synchronisation. This decoupling is the key to achieving universal applicability across the whole range...
1116	Using MPI: Portable Parallel Programming with the Message Passing Interface, 2nd ed - Gropp, Skjellum - 1999
782	A Fast Algorithm for Particle Simulations - Greengard, Rokhlin - 1987
513	Logp: Towards a realistic model of parallel computation - Culler, Karp, et al. - 1993
337	C.: Computational Framework of the Fast Fourier Transform - Loan - 1992
215	A hierarchical O(N log N ) force-calculation algorithm - Barnes, Hut - 1986
169	Direct Bulk-Synchronous Parallel Algorithms - Gerbessiotis, Valiant - 1994
156	Parallel programming in Split-C - Culler, Arpaci-Dusseau, et al. - 1993
148	An efficient program for many-body simulation - Appel - 1985
139	Towards an architecture-independent analysis of parallel algorithms - Papadimitriou, Yannakakis - 1990
126	A Logarithmic Time Sort for Linear Size Networks - Reif, Valiant - 1987
88	Astrophysical N-body simulations using hierarchical tree data structures - Warren, Salmon - 1992
83	Universal computing - McColl (Show Context) Citation Context ...ore di#cult than for sequential programs. Recent research on Bulk Synchronous Parallel (BSP) algorithms, architectures and languages has shown that the BSP model can achieve all of these requirements =-=[7, 3, 6, 2, 1, 5]-=-. The BSP model decouples the two fundamental aspects of parallel computation, communication and synchronisation. This decoupling is the key to achieving universal applicability across the whole range...
72	Scientific computing on bulk synchronous parallel architectures - Bisseling, McColl - 1994
57	A library for bulk{synchronous parallel programming. British computer society parallel processing http://www.comlab.ox.uk/oucl/oxpara/bsplib.html - Miller - 1993 (Show Context) Citation Context ...ore di#cult than for sequential programs. Recent research on Bulk Synchronous Parallel (BSP) algorithms, architectures and languages has shown that the BSP model can achieve all of these requirements =-=[7, 3, 6, 2, 1, 5]-=-. The BSP model decouples the two fundamental aspects of parallel computation, communication and synchronisation. This decoupling is the key to achieving universal applicability across the whole range...
54	Fast Parallel Sorting Under LogP: Experience with the CM5 - Dusseau, Schauser, et al. - 1996
53	Parallel sorting and data partitioning by sampling - Huang, Chow - 1983
51	Samplesort: A sampling approach to minimal storage tree sorting - Frazer, McKellar - 1970
42	An O(n) algorithm for three-dimensional N-body simulations - Zhao - 1987
34	Towards efficiency and portability: Programming with the BSP model - Goudreau, Lang, et al. - 1996
33	Theory, practice, and a tool for BSP performance prediction - Hill, Crumpton, et al. - 1996
32	A quantitative comparison of parallel computation models - Juurlink, Wijshoff - 1996
31	Lessons learned from implementing bsp - Hill, Skillicorn - 1998
28	Bulk Synchronous Parallel Computing — A Paradigm for Transportable Software - Cheatham, Fahmy, et al. - 1995 (Show Context) Citation Context ...ore di#cult than for sequential programs. Recent research on Bulk Synchronous Parallel (BSP) algorithms, architectures and languages has shown that the BSP model can achieve all of these requirements =-=[7, 3, 6, 2, 1, 5]-=-. The BSP model decouples the two fundamental aspects of parallel computation, communication and synchronisation. This decoupling is the key to achieving universal applicability across the whole range...
28	Implementations of randomized sorting on large parallel machines - Hightower, Prins, et al. - 1992
23	portability and predictability: The BSP approach to parallel programming - Scalability - 1996
21	Experiences with Parallel N-Body Simulation - Liu, Bhatt - 2000
17	The Green BSP Library - Goudreau, Lang, et al. - 1995
14	Highly Portable and Efficient Implementations of Parallel Adaptive N-Body Methods - Blackston, Suel - 1997
14	Predictable communication on unpredictable networks: Implementing BSP over TCP/IP - Donaldson, Hill, et al. - 1998
11	Stability of communication performance in practice: from the Cray T3E to networks of workstations - Hill, Donaldson, et al. - 1997
9	Sparse matrix computations on bulk synchronous parallel computers - Bisseling - 1995
8	Basic Techniques for Numerical Linear Algebra on Bulk Synchronous Parallel Computers - Bisseling - 1997
7	Portability of performance with the BSPlib communications library - Hill, Donaldson, et al. - 1997
5	Torsten Suel, and Thanasis Tsantilas. Towards efficiency and portability: Programming with the BSP model - Goudreau, Lang, et al. - 1996 (Show Context) Citation Context ...ore di#cult than for sequential programs. Recent research on Bulk Synchronous Parallel (BSP) algorithms, architectures and languages has shown that the BSP model can achieve all of these requirements =-=[7, 3, 6, 2, 1, 5]-=-. The BSP model decouples the two fundamental aspects of parallel computation, communication and synchronisation. This decoupling is the key to achieving universal applicability across the whole range...
3	A comparison of sorting algorithms - Blelloch, Leiserson, et al. - 1991
3	Bulk-Synchronous Parallel Computing on the Maspar - Shumaker, Goudreau - 1997
2	SHMEM user's guide, revision 2.0 - Barriuso, Knies - 1994
2	A parallel finite element method for electro-magnetic scattering - Monk, Parrott, et al. - 1994