{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:40:56Z","timestamp":1775054456557,"version":"3.50.1"},"reference-count":31,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1016\/s0167-8191(02)00218-1","type":"journal-article","created":{"date-parts":[[2003,1,17]],"date-time":"2003-01-17T14:52:57Z","timestamp":1042815177000},"page":"187-207","source":"Crossref","is-referenced-by-count":57,"title":["The Paderborn University BSP (PUB) library"],"prefix":"10.1016","volume":"29","author":[{"given":"Olaf","family":"Bonorden","sequence":"first","affiliation":[]},{"given":"Ben","family":"Juurlink","sequence":"additional","affiliation":[]},{"given":"Ingo","family":"von Otte","sequence":"additional","affiliation":[]},{"given":"Ingo","family":"Rieping","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(02)00218-1_BIB1","doi-asserted-by":"crossref","unstructured":"M. Adler, Asynchronous shared memory search structures, in: Proc. Symp. on Parallel Algorithms and Architectures 1996","DOI":"10.1145\/237502.237506"},{"key":"10.1016\/S0167-8191(02)00218-1_BIB2","unstructured":"R.D. Alpert, J.F. Philbin, cBSP: Zero-Cost Synchronization in a Modified BSP Model. Technical Report 97-054, NEC Research Institute, 1997"},{"key":"10.1016\/S0167-8191(02)00218-1_BIB3","doi-asserted-by":"crossref","unstructured":"R. Barriuso, A. Knies, SHMEM User\u2019s Guide, Revision 2.0, 1994","DOI":"10.1145\/602770.602792"},{"key":"10.1016\/S0167-8191(02)00218-1_BIB4","doi-asserted-by":"crossref","DOI":"10.1016\/S0304-3975(98)00020-6","article-title":"Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model","volume":"203","author":"B\u00e4umker","year":"1998","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0167-8191(02)00218-1_BIB5","unstructured":"O. Bonorden, J. Gehweiler, P. Olszta, R. Wanka, PUB-Library Version 8.0, 2002. Available via www.uni-paderborn.de\/\u223cpub"},{"key":"10.1016\/S0167-8191(02)00218-1_BIB6","unstructured":"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"},{"key":"10.1016\/S0167-8191(02)00218-1_BIB7","doi-asserted-by":"crossref","unstructured":"R. Diekmann, D. Meyer, B. Monien, Parallel decomposition of unstructured FEM-Meshes, in: Proc. IRREGULAR. Springer LNCS 980, 1995","DOI":"10.1007\/3-540-60321-2_17"},{"key":"10.1016\/S0167-8191(02)00218-1_BIB8","unstructured":"A. Fahmy, A. Heddaya, Communicable Memory and Lazy Barriers for Bulk Synchronous Parallelism in BSPk. Technical Report BU-CS-96-012, Boston Univ., 1996"},{"key":"10.1016\/S0167-8191(02)00218-1_BIB9","unstructured":"A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, V. Sunderam, PVM 3 Users Guide and Reference Manual. Oak Ridge National Laboratory, 1994"},{"issue":"2","key":"10.1016\/S0167-8191(02)00218-1_BIB10","doi-asserted-by":"crossref","DOI":"10.1006\/jpdc.1994.1085","article-title":"Direct bulk-synchronous parallel algorithms","volume":"22","author":"Gerbessiotis","year":"1994","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10.1016\/S0167-8191(02)00218-1_BIB11","unstructured":"A. Goldman, D. Trystram, J. Peters, Exchange of messages of different sizes, in: Proc. IRREGULAR. Springer LNCS 1457, 1998"},{"key":"10.1016\/S0167-8191(02)00218-1_BIB12","unstructured":"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"},{"key":"10.1016\/S0167-8191(02)00218-1_BIB13","unstructured":"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"},{"key":"10.1016\/S0167-8191(02)00218-1_BIB14","unstructured":"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"},{"issue":"14","key":"10.1016\/S0167-8191(02)00218-1_BIB15","doi-asserted-by":"crossref","DOI":"10.1016\/S0167-8191(98)00093-3","article-title":"BSPlib: the BSP programming library","volume":"24","author":"Hill","year":"1998","journal-title":"Parallel Computing"},{"key":"10.1016\/S0167-8191(02)00218-1_BIB16","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1109\/IPPS.1998.669961"},{"key":"10.1016\/S0167-8191(02)00218-1_BIB17","unstructured":"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"},{"issue":"6","key":"10.1016\/S0167-8191(02)00218-1_BIB18","doi-asserted-by":"crossref","DOI":"10.1016\/0020-0190(96)00073-7","article-title":"Communication primitives for BSP computers","volume":"58","author":"Juurlink","year":"1996","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0167-8191(02)00218-1_BIB19","unstructured":"C.W. Ke\u00dfler, NestStep: nested parallelism and virtual shared memory for the BSP model, in: Proc. Int. Conf. on Parallel and Distributed Processing Techniques and Applications, 1999"},{"key":"10.1016\/S0167-8191(02)00218-1_BIB20","doi-asserted-by":"crossref","DOI":"10.1016\/S0020-0190(98)00061-1","article-title":"Relaxed barrier synchronization for the BSP model of computation on message-passing architectures","volume":"66","author":"Kim","year":"1998","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0167-8191(02)00218-1_BIB21","doi-asserted-by":"crossref","unstructured":"W.F. McColl, Universal computing, in: Proc. Euro-Par. Springer LNCS 1123, 1996","DOI":"10.1007\/3-540-61626-8_3"},{"key":"10.1016\/S0167-8191(02)00218-1_BIB22","unstructured":"Message Passing Interface Forum. MPI: a Message passing interface, in: Proc. Supercomputing, 1993"},{"key":"10.1016\/S0167-8191(02)00218-1_BIB23","unstructured":"Message Passing Interface Forum. MPI-2: Extension to the Message Passing Interface. Technical report, Univ. of Tennessee, 1997"},{"key":"10.1016\/S0167-8191(02)00218-1_BIB24","unstructured":"R. Miller, A library for bulk synchronous parallel programming, in: Proc. BCS Parallel Processing Specialist Group Workshop on General Purpose Parallel Computing, 1993"},{"issue":"3","key":"10.1016\/S0167-8191(02)00218-1_BIB25","doi-asserted-by":"crossref","DOI":"10.1145\/322326.322329","article-title":"Parallel permutation and sorting algorithms and a new generalized connection network","volume":"29","author":"Nassimi","year":"1982","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0167-8191(02)00218-1_BIB26","unstructured":"I. Rieping, Communication in Parallel Systems\u2013\u2013Models, Algorithms and Implementations. PhD thesis, Paderborn University, 2000"},{"key":"10.1016\/S0167-8191(02)00218-1_BIB27","unstructured":"F. de Sande, El Modelo de Computaci\u00f3n Colectiva: Una Metodolog\u0131\u0301a Eficiente para la Ampliaci\u00f3n del Modelo de Librer\u0131\u0301a de Paso de Mensajes con Paralelismo de Datos Anidado. PhD thesis, University of La Laguna, Spain, 1998. (In Spanish)"},{"issue":"1","key":"10.1016\/S0167-8191(02)00218-1_BIB28","doi-asserted-by":"crossref","DOI":"10.1016\/0743-7315(92)90056-S","article-title":"Finding and exploiting parallelism in an ocean simulation program: experience, results and implications","volume":"15","author":"Singh","year":"1992","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10.1016\/S0167-8191(02)00218-1_BIB29","unstructured":"D.B. Skillicorn, miniBSP: a BSP Language and Transformation System. Technical report, Dept. of Computing and Information Sciences, Queens\u2019 University, Kingston, Canada, 1996"},{"issue":"3","key":"10.1016\/S0167-8191(02)00218-1_BIB30","article-title":"Questions and answers about BSP","volume":"6","author":"Skillicorn","year":"1997","journal-title":"Journal of Scientific Programming"},{"issue":"8","key":"10.1016\/S0167-8191(02)00218-1_BIB31","doi-asserted-by":"crossref","DOI":"10.1145\/79173.79181","article-title":"A bridging model for parallel computation","volume":"33","author":"Valiant","year":"1990","journal-title":"Communications of the ACM"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819102002181?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819102002181?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T14:53:00Z","timestamp":1553957580000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819102002181"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S0167819102002181"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(02)00218-1","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}