The Paderborn university BSP (PUB) library-design, implementation and performance

The Paderborn University BSP (PUB) library is a parallel C library based on the BSP model. The basic library supports buffered and unbuffered asynchronous communication between any pair of processors, and a mechanism for synchronizing the processors in a barrier style. In addition, it provides routines for collective communication on arbitrary subsets of processors, partition operations, and a zero-cost synchronization mechanism. Furthermore, some techniques used in its implementation deviate significantly from the techniques used in other BSP libraries.

[1]  Abdelsalam A. Heddaya,et al.  Communicable Memory and Lazy Barriers for Bulk Synchronous Parallelism in BSPk , 1996 .

[2]  Sartaj Sahni,et al.  Parallel permutation and sorting algorithms and a new generalized connection network , 1982, JACM.

[3]  Micah Adler,et al.  Asynchronous Shared Memory Search Structures , 1996, SPAA '96.

[4]  Corporate The MPI Forum,et al.  MPI: a message passing interface , 1993, Supercomputing '93.

[5]  Andrea C. Arpaci-Dusseau,et al.  Parallel programming in Split-C , 1993, Supercomputing '93. Proceedings.

[6]  William F. McColl,et al.  Scalable Computing , 1995, Computer Science Today.

[7]  Jack Dongarra,et al.  Pvm 3 user's guide and reference manual , 1993 .

[8]  Torsten Suel,et al.  BSPlib: The BSP programming library , 1998, Parallel Comput..

[9]  Jin-Soo Kim,et al.  Relaxed Barrier Synchronization for the BSP Model of Computation on Message-Passing Architectures , 1998, Inf. Process. Lett..

[10]  Ben H. H. Juurlink,et al.  Experimental validation of parallel computation models on the Intel Paragon , 1998, Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing.

[11]  Leslie G. Valiant,et al.  A bridging model for parallel computation , 1990, CACM.

[12]  Ralf Diekmann,et al.  Parallel Decomposition of Unstructured FEM-Meshes , 1995, Concurr. Pract. Exp..

[13]  David B. Skillicorn,et al.  Questions and Answers about BSP , 1997, Sci. Program..

[14]  Friedhelm Meyer auf der Heide,et al.  Truly Efficient Parallel Algorithms: 1-optimal Multisearch for an Extension of the BSP Model , 1998, Theor. Comput. Sci..