The Paderborn University BSP (PUB) library

Parallel Computing

Volumn 29, Issue 2, 2003, Pages 187-207

  Bonorden, Olaf ^a   Juurlink, Ben ^b   von Otte, Ingo ^a   Rieping, Ingo ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

^b DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Bulk synchronous parallel model; Collective communication; Nested parallelism; Oblivious synchronization; Parallel communication library

Indexed keywords

COSTS; LIBRARIES; PROGRAM PROCESSORS; SYNCHRONIZATION;

PARALLEL COMMUNICATION LIBRARIES;

PARALLEL PROCESSING SYSTEMS;

EID: 0037303080     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(02)00218-1     Document Type: Article

References (31)

1. M. Adler, Asynchronous shared memory search structures, in: Proc. Symp. on Parallel Algorithms and Architectures 1996.
2. R.D. Alpert, J.F. Philbin, cBSP: Zero-Cost Synchronization in a Modified BSP Model. Technical Report 97-054, NEC Research Institute, 1997.
3. R. Barriuso, A. Knies, SHMEM User's Guide, Revision 2.0, 1994.
4. Bäumker A., Dittrich W., Meyer auf der Heide F. Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model. Theoretical Computer Science. 203:1998.
5. O. Bonorden, J. Gehweiler, P. Olszta, R. Wanka, PUB-Library Version 8.0, 2002. Available via www.uni-paderborn.de/̃pub.
6. D.E. Culler, A. Dusseau, S.C. Goldstein, A. Krishnamurthy, S. Lumetta, T. von Eicken, K. Yelick, Parallel programming in Split-C, in: Proc. Supercomputing, 1993.
7. R. Diekmann, D. Meyer, B. Monien, Parallel decomposition of unstructured FEM-Meshes, in: Proc. IRREGULAR. Springer LNCS 980, 1995.
8. A. Fahmy, A. Heddaya, Communicable Memory and Lazy Barriers for Bulk Synchronous Parallelism in BSPk. Technical Report BU-CS-96-012, Boston Univ., 1996.
9. A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, V. Sunderam, PVM 3 Users Guide and Reference Manual. Oak Ridge National Laboratory, 1994.
10. Gerbessiotis A.V., Valiant L.G. Direct bulk-synchronous parallel algorithms. Journal of Parallel and Distributed Computing. 22(2):1994.
11. A. Goldman, D. Trystram, J. Peters, Exchange of messages of different sizes, in: Proc. IRREGULAR. Springer LNCS 1457, 1998.
12. J.A. Gonzalez, C. Leon, F. Piccoli, M. Printista, J.L. Roda, C. Rodriguez, F. de Sande, Groups in bulk synchronous parallel computing, in: Proc. EuroMicro Workshop on Parallel and Distributed Processing, 2000.
13. J.A. Gonzalez, C. Leon, F. Piccoli, M. Printista, J.L. Roda, C. Rodriguez, F. de Sande, Oblivious BSP, in: Proc. Euro-Par. Springer LNCS 1900, 2000.
14. M.W. Goudreau, K. Lang, S.B. Rao, T. Tsantilas, The Green BSP Library. Technical Report TR-95-11, University of Central Florida, Orlando, 1995.
15. Hill J.M.D., McColl W.F., Stefanescu D.C., Goudreau M.W., Lang K., Rao S.B., Suel T., Tsantilas T., Bisseling R. BSPlib: the BSP programming library. Parallel Computing. 24(14):1998.
16. B.H.H. Juurlink, Experimental validation of parallel computation models on the Intel Paragon, in: Proc. IPPS/SPDP, 1998. Full version TR-RSFB-98-055, Paderborn University.
17. B.H.H. Juurlink, I. Rieping. Performance relevant issues for parallel computation models, in: Proc. Int. Conf. on Parallel and Distributed Processing Techniques and Applications, 2001.
18. Juurlink B.H.H., Wijshoff H.A.G. Communication primitives for BSP computers. Information Processing Letters. 58(6):1996.
19. C.W. Keßler, NestStep: nested parallelism and virtual shared memory for the BSP model, in: Proc. Int. Conf. on Parallel and Distributed Processing Techniques and Applications, 1999.
20. Kim J.-S., Ha S., Jhon C.S. Relaxed barrier synchronization for the BSP model of computation on message-passing architectures. Information Processing Letters. 66:1998.
21. W.F. McColl, Universal computing, in: Proc. Euro-Par. Springer LNCS 1123, 1996.
22. Message Passing Interface Forum. MPI: a Message passing interface, in: Proc. Supercomputing, 1993.
23. Message Passing Interface Forum. MPI-2: Extension to the Message Passing Interface. Technical report, Univ. of Tennessee, 1997.
24. R. Miller, A library for bulk synchronous parallel programming, in: Proc. BCS Parallel Processing Specialist Group Workshop on General Purpose Parallel Computing, 1993.
25. Nassimi D., Sahni S. Parallel permutation and sorting algorithms and a new generalized connection network. Journal of the ACM. 29(3):1982.
26. I. Rieping, Communication in Parallel Systems - Models, Algorithms and Implementations. PhD thesis, Paderborn University, 2000.
27. F. de Sande, 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. PhD thesis, University of La Laguna, Spain, 1998. (In Spanish).
28. Singh J.P., Hennessy J.L. Finding and exploiting parallelism in an ocean simulation program: experience, results and implications. Journal of Parallel and Distributed Computing. 15(1):1992.
29. D.B. Skillicorn, miniBSP: a BSP Language and Transformation System. Technical report, Dept. of Computing and Information Sciences, Queens' University, Kingston, Canada, 1996.
30. Skillicorn D.B., Hill J.M.D., McColl W.F. Questions and answers about BSP. Journal of Scientific Programming. 6(3):1997.
31. Valiant L.G. A bridging model for parallel computation. Communications of the ACM. 33(8):1990.