Hostname: page-component-74656f9884-npj9w Total loading time: 0 Render date: 2026-11-10T02:58:53.297Z Has data issue: false hasContentIssue false
  • English
  • Français

Pipelined Decomposable BSP Computers

Published online by Cambridge University Press:  15 December 2002

Martin Beran
Martin Beran*
Affiliation:
Faculty of Mathematics and Physics, Charles University, Malostranské nám. 25, 118 00 Praha 1, Czech Republic; beran@ms.mff.cuni.cz.
Get access

Abstract

The class of weak parallel machines is interesting, because it contains somerealistic parallel machine models, especially suitable for pipelinedcomputations. We prove that a modification of the bulk synchronous parallel(BSP) machine model, called decomposable BSP (dBSP), belongs to the class ofweak parallel machines if restricted properly. We will also correct someearlier results about pipelined parallel Turing machines.

Keywords

BSPcomplexity theorymodels of compuationparallel computingpipelining.

Information

Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 36 , Issue 1 , January 2002 , pp. 43 - 65
Copyright
© EDP Sciences, 2002

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

M. Beran, Decomposable bulk synchronous parallel computers, in Proc. of SOFSEM '99. Springer-Verlag, Lecture Notes in Comput. Sci. 1725 (1999) 349-359. http://www.ms.mff.cuni.cz/~beran/publications.html
M. Beran, Formalizing, analyzing, and extending the model of bulk synchronous parallel computer, Technical Report V-829. Institute of Computer Science, Academy of Sciences of the Czech Republic (2000). http://www.cs.cas.cz/research/library/reports_800.shtml
O. Bonorden, B. Juurlink, I. von Otte and I. Rieping, The Paderborn University BSP (PUB) library - design, implementation and performance, in Proc. of 13th International Parallel Processing Symposium & 10th Symposium on Parallel and Distributed Processing (IPPS/SPDP). San Juan, Puerto Rico (1999). http://www.uni-paderborn.de/~pub/
P. van Emde Boas, Machine models and simulations, edited by J. van Leeuwen. Elsevier Science Publishers, Amsterdam, Handb. Theoret. Comput. Sci. A (1990) 1-66.
P. van Emde Boas, The second machine class, model of parallelism, edited by J. van Leeuwen, J.K. Lenstra and A.H.G. Rinnooy Kan. Centre for Mathematics and Computer Science, Amsterdam, Parallel Computers and Computations, CWI Syllabus 9 (1985) 133-161.
A.V. Gerbessiotis and C.J. Siniolakis, Primitive operations on the BSP model, Technical Report PRG-TR-23-96. Oxford University Computing Laboratory, Oxford (1996).
Gerbessiotis, A.V. and Valiant, L.G., Direct bulk-synchronous parallel algorithms. J. Parallel Distributed Comput. 22 (1994) 251-267. CrossRef
D.Q. Goldin, S.A. Smolka and P. Wegner, Turing machines, transition systems, and interaction (submitted). http://www.cs.umb.edu/~dqg/papers/mfcs.ps
J.M.D. Hill, W. McColl, D.C. Stefanescu, M.W. Goudreau, K. Lang, S.B. Rao, T. Suel,T. Tsantilas and R. Bisseling, BSPlib: The BSP programming library. BSPlib reference manual with ANSI C examples (1998). http://www.bsp-worldwide.org/implmnts/oxtool/
Juurlink, B.H.H. and Wijshoff, H.A.G., Communication primitives for BSP computers. Inform. Process. Lett. 58 (1996) 303-310. CrossRef
R.M. Karp and V. Ramachandran, Parallel algorithms for shared-memory machines, edited by J. van Leeuwen. Elsevier Science Publishers, Amsterdam, Handb. Theoret. Comput. Sci. A (1990) 869-941.
J. van Leeuwen and J. Wiedermann, The Turing machine paradigm in contemporary computing, edited by B. Enquist and W. Schmidt. Springer-Verlag, Mathematics Unlimited -- 2001 and Beyond (2001) 1139-1155.
W.F. McColl, Bulk synchronous parallel computing, edited by J.R. Davy and P.M. Dew. Oxford University Press, Abstract Machine Models for Highly Parallel Computers (1995) 41-63.
C. Slot and P. van Emde Boas, On tape versus core; an application of space efficient perfect hash function to the invariance of space, in Proc. of STOC'84. Washington D.C. (1984) 391-400.
Valiant, L.G., A bridging model for parallel computation. Comm. ACM 33 (1990) 103-111. CrossRef
P. Wegner, Models and paradigms of interaction. OOPSLA Tutorial Notes (1995).
J. Wiedermann, Weak parallel machines: A new class of physically feasible parallel machine models, in Mathematical Foundations of Computer Science 1992, 17th Int. Symposium (MFCS'92), edited by I.M. Havel and V. Koubek. Springer-Verlag, Berlin, Lecture Notes in Comput. Sci. 629 (1992) 95-111.