article

The Paderborn University BSP (PUB) library

Authors:

Ingo RiepingAuthors Info & Claims

Parallel Computing, Volume 29, Issue 2

Pages 187 - 207

https://doi.org/10.1016/S0167-8191(02)00218-1

Published: 01 February 2003 Publication History

Abstract

The Paderborn University BSP (PUB) library is a C communication library based on the BSP model. The basic library supports buffered as well as unbuffered non-blocking communication between any pair of processors and a mechanism for synchronizing the processors in a barrier style. In addition, PUB provides non-blocking collective communication operations on arbitrary subsets of processors, the ability to partition the processors into independent groups that execute asynchronously from each other, and a zero-cost synchronization mechanism. Furthermore, some techniques used in the implementation of the PUB library deviate significantly from the techniques used in other BSP libraries.

References

[1]

{1} M. Adler, Asynchronous shared memory search structures, in: Proc. Symp. on Parallel Algorithms and Architectures 1996.

[2]

{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]

{3} R. Barriuso, A. Knies, SHMEM User's Guide, Revision 2.0, 1994.

[4]

{4} A. Bäumker, W. Dittrich, F. Meyer auf der Heide, Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model, Theoretical Computer Science 203 (1998).

[5]

{5} O. Bonorden, J. Gehweiler, P. Olszta, R. Wanka, PUB-Library Version 8.0, 2002. Available via www.uni-paderborn.de/~pub.

[6]

{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]

{7} R. Diekmann, D. Meyer, B. Monien, Parallel decomposition of unstructured FEM-Meshes, in: Proc. IRREGULAR. Springer LNCS 980, 1995.

[8]

{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]

{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]

{10} A.V. Gerbessiotis, L.G. Valiant, Direct bulk-synchronous parallel algorithms, Journal of Parallel and Distributed Computing 22 (2) (1994).

Digital Library

[11]

{11} A. Goldman, D. Trystram, J, Peters, Exchange of messages of different sizes, in: Proc. IRREGULAR. Springer LNCS 1457, 1998.

[12]

{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]

{13} J.A. Gonzalez, C. Leon, F. Piccoli, M. Priutista, J.L. Roda, C. Rodriguez, F. de Sande, Oblivious BSP, in: Proc. Euro-Par. Springer LNCS 1900, 2000.

[14]

{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]

{15} J.M.D. Hill, W.F. McColl, D.C. Stefanescu, M.W. Goudrean, K. Lang, S.B. Rao, T. Suel, T. Tsantilas, R. Bisseling, BSPlib: the BSP programming library, Parallel Computing 24 (14) (1998).

Digital Library

[16]

{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]

{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]

{18} B.H.H. Juurlink, H.A.G. Wijshoff, Communication primitives for BSP computers, Information Processing Letters 58 (6) (1996).

Digital Library

[19]

{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]

{20} J.-S. Kim, S. Ha, C.S. Jhon, Relaxed barrier synchronization for the BSP model of computation on message-passing architectures, Information Processing Letters 66 (1998).

[21]

{21} W.F. McColl, Universal computing, in: Proc. Euro-Par. Springer LNCS 1123, 1996.

[22]

{22} Message Passing Interface Forum. MPI: a Message passing interface, in: Proc. Supercomputing, 1993.

[23]

{23} Message Passing Interface Forum. MPI-2: Extension to the Message Passing Interface. Technical report, Univ. of Tennessee, 1997.

[24]

{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]

{25} D. Nassimi, S. Sahni, Parallel permutation and sorting algorithms and a new generalized connection network, Journal of the ACM 29 (3) (1982).

Digital Library

[26]

{26} I. Rieping, Communication in Parallel Systems--Models, Algorithms and Implementations. PhD thesis, Paderborn University, 2000.

[27]

{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]

{28} J.P. Singh, J.L. Heunessy, Finding and exploiting parallelism in an ocean simulation program: experience, results and implications, Journal of Parallel and Distributed Computing 15 (1) (1992).

Digital Library

[29]

{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]

{30} D.B. Skillicorn, J.M.D. Hill, W.F. McColl, Questions and answers about BSP, Journal of Scientific Programming 6 (3) (1997).

[31]

{31} L.G. Valiant, A bridging model for parallel computation, Communications of the ACM 33 (8) (1990).

Digital Library

Cited By

Wang QZheng LZhao JLiao XJin HXue J(2020)A Conflict-free Scheduler for High-performance Graph Processing on Multi-pipeline FPGAsACM Transactions on Architecture and Code Optimization10.1145/339052317:2(1-26)Online publication date: 29-May-2020
https://dl.acm.org/doi/10.1145/3390523
Jakobsson ADabrowski FBousdira WHung CPapadopoulos G(2019)Safe usage of registers in BSPlibProceedings of the 34th ACM/SIGAPP Symposium on Applied Computing10.1145/3297280.3297421(1400-1407)Online publication date: 8-Apr-2019
https://dl.acm.org/doi/10.1145/3297280.3297421
Alaniz MNesmachnow S(2019)A semi-Automatic Approach for Parallel Problem Solving using the Multi-BSP ModelProgramming and Computing Software10.1134/S036176881908010345:8(517-531)Online publication date: 1-Dec-2019
https://dl.acm.org/doi/10.1134/S0361768819080103
Show More Cited By

Index Terms

The Paderborn University BSP (PUB) library

Recommendations

The Paderborn University BSP (PUB) Library - Design, Implementation and Performance
IPPS '99/SPDP '99: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing

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 ...
Employing nested OpenMP for the parallelization of multi-zone computational fluid dynamics applications
Special issue: 18^th International parallel and distributed processing symposium

In this paper we describe the parallelization of the multi-zone code versions of the NAS Parallel Benchmarks employing multi-level OpenMP parallelism. For our study, we use the NanosCompiler that supports nesting of OpenMP directives and provides ...
Helper locks for fork-join parallel programming
PPoPP '10: Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming

Helper locks allow programs with large parallel critical sections, called parallel regions, to execute more efficiently by enlisting processors that might otherwise be waiting on the helper lock to aid in the execution of the parallel region. Suppose ...

Comments

Information & Contributors

Information

Published In

cover image Parallel Computing

Parallel Computing Volume 29, Issue 2

February 2003

115 pages

ISSN:0167-8191

Issue’s Table of Contents

Publisher

Elsevier Science Publishers B. V.

Netherlands

Publication History

Published: 01 February 2003

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

34
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 28 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Wang QZheng LZhao JLiao XJin HXue J(2020)A Conflict-free Scheduler for High-performance Graph Processing on Multi-pipeline FPGAsACM Transactions on Architecture and Code Optimization10.1145/339052317:2(1-26)Online publication date: 29-May-2020
https://dl.acm.org/doi/10.1145/3390523
Jakobsson ADabrowski FBousdira WHung CPapadopoulos G(2019)Safe usage of registers in BSPlibProceedings of the 34th ACM/SIGAPP Symposium on Applied Computing10.1145/3297280.3297421(1400-1407)Online publication date: 8-Apr-2019
https://dl.acm.org/doi/10.1145/3297280.3297421
Alaniz MNesmachnow S(2019)A semi-Automatic Approach for Parallel Problem Solving using the Multi-BSP ModelProgramming and Computing Software10.1134/S036176881908010345:8(517-531)Online publication date: 1-Dec-2019
https://dl.acm.org/doi/10.1134/S0361768819080103
da Rosa Righi Rde Quadros Gomes RRodrigues Vda Costa CAlberti APilla LNavaux P(2018)MigPFFuture Generation Computer Systems10.1016/j.future.2016.05.00478:P1(272-286)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.1016/j.future.2016.05.004
Buurlage JBannink TBisseling R(2018)Bulk: A Modern C++ Interface for Bulk-Synchronous Parallel ProgramsEuro-Par 2018: Parallel Processing10.1007/978-3-319-96983-1_37(519-532)Online publication date: 27-Aug-2018
https://dl.acm.org/doi/10.1007/978-3-319-96983-1_37
Hains GHenrio LLeca PSuijlen W(2018)Active Objects for Coordinating BSP Computations (Short Paper)Coordination Models and Languages10.1007/978-3-319-92408-3_10(220-230)Online publication date: 18-Jun-2018
https://dl.acm.org/doi/10.1007/978-3-319-92408-3_10
Allombert VGava FTesson J(2017)Multi-MLInternational Journal of Parallel Programming10.1007/s10766-016-0417-645:2(340-361)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1007/s10766-016-0417-6
Fortin JGava F(2016)BSP-WhyInternational Journal of Parallel Programming10.1007/s10766-015-0360-y44:3(574-597)Online publication date: 1-Jun-2016
https://dl.acm.org/doi/10.1007/s10766-015-0360-y
Zou TBras RSalles MDemers AGehrke J(2015)ClouDiAThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-014-0375-924:5(633-653)Online publication date: 1-Oct-2015
https://dl.acm.org/doi/10.1007/s00778-014-0375-9
Yzelman ABisseling RRoose DMeerbergen K(2014)MulticoreBSP for CInternational Journal of Parallel Programming10.5555/2630180.263018542:4(619-642)Online publication date: 1-Aug-2014
https://dl.acm.org/doi/10.5555/2630180.2630185
Show More Cited By

View Options

View options

Figures

Tables

Media

View Issue’s Table of Contents