The Paderborn University BSP (PUB) library

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

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

[3]  Leslie G. Valiant,et al.  Direct Bulk-Synchronous Parallel Algorithms , 1992, J. Parallel Distributed Comput..

[4]  John L. Hennessy,et al.  Finding and Exploiting Parallelism in an Ocean Simulation Program: Experience, Results, and Implications , 1992, J. Parallel Distributed Comput..

[5]  T. von Eicken,et al.  Parallel programming in Split-C , 1993, Supercomputing '93.

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

[7]  Denis A. Nicole.  High Performance Architectures, Invited Lecture at the BCS Parallel Processing Specialist Group Workshop on General Purpose Parallel Computing, London, December 1993 , 1993 .

[8]  Ben H. H. Juurlink,et al.  Communication Primitives for BSP Computers , 1996, Inf. Process. Lett..

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

[10]  William F. McColl.  Universal Computing , 1996, Euro-Par, Vol. I.

[11]  David B. Skillicorn.  MiniBSP: A BSP Language and Transformation System , 1996 .

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

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

[14]  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.

[15]  Denis Trystram,et al.  Exchange of Messages of Different Sizes , 1998, IRREGULAR.

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

[17]  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..

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

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

[20]  Christoph W. Kessler.  NestStep: Nested Parallelism and Virtual Memory for the BSP Model , 1999, PDPTA.

[21]  Ingo Rieping.  Communication in parallel systems: models, algorithms and implementations , 2000 .

[22]  A. Marcela Printista,et al.  Oblivious BSP (Research Note) , 2000, Euro-Par.

[23]  A. Marcela Printista,et al.  Groups in bulk synchronous parallel computing , 2000, Proceedings 8th Euromicro Workshop on Parallel and Distributed Processing.

[24]  Ben Juurlink,et al.  Performance relevant issues for parallel computation models , 2001 .

[25]  Francisco de Sande González.  El modelo de computación colectiva: una metodología eficiente para la ampliación del modelo de librería de paso de mensajes con paralelismo de datos anidado , 2002 .

[26]  A. ADoefaa,et al.  ? ? ? ? f ? ? ? ? ? , 2003 .

[27]  Christoph W. Kessler,et al.  NestStep: Nested Parallelism and Virtual Shared Memory for the BSP Model , 2000, The Journal of Supercomputing.