Skip to main content
Springer Nature Link
Log in

Pipelined Decomposable BSP Computers

(Extended Abstract)

  • Conference paper
  • First Online:
SOFSEM 2001: Theory and Practice of Informatics (SOFSEM 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2234))

  • 293 Accesses

Abstract

The class of weak parallel machines Cweak is interesting because it contains some realistic parallel machine models, especially suitable for pipelined computations. We prove that a modification of the bulk synchronous parallel (BSP) machine model, called decomposable BSP (dBSP), belongs to the class of weak parallel machines if its computational power is restricted properly. We will also correct some earlier results about pipelined parallel Turing machines, regarding their membership in the class Cweak.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. M. Beran. Decomposable bulk synchronous parallel computers. In Proceedings of SOFSEM’ 99, LNCS 1725, pp. 349–359. Springer-Verlag, 1999.

    Google Scholar 

  2. M. Beran. Formalizing, analyzing, and extending the model of bulk synchronousparallel computer. Technical Report V-829, Institute of Computer Science, Academy of Sciences of the Czech Republic, December 2000.http://www.cs.cas.cz/research/library/reports 800.shtml

  3. O. Bonorden, B. Juurlink, I. von Otte, and I. Rieping. The Paderborn University BSP (PUB) library — design, implementation and performance. In Proceedings of 13th International Parallel Processing Symposium & 10th Symposium on Paralleland Distributed Processing (IPPS/SPDP), San Juan, Puerto Rico, April 1999.

    Google Scholar 

  4. A. V. Gerbessiotis and C. J. Siniolakis. Primitive operations on the BSP model.Technical Report PRG-TR-23-96, Oxford University Computing Laboratory, Oxford, October 1996.

    Google Scholar 

  5. A. V. Gerbessiotis and L. G. Valiant. Direct bulk-synchronous parallel algorithms.Journal of Parallel and Distributed Computing, 22:251–267, 1994.

    Article  Google Scholar 

  6. J. M. D. Hill, W. F. McColl, D. C. Stefanescu, M. W. Goudreau, K. Lang, S. B. Rao, T. Suel, and T. Tsantilas and R. Bisseling. BSPlib: The BSP programminglibrary, 1998. BSPlib reference manual with ANSI C examples.http://www.bsp-worldwide.org/implmnts/oxtool/

  7. B. H. H. Juurlink and H. A. G. Wijsho.. Communication primitives for BSPcomputers. Information Processing Letters, 58:303–310, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  8. W. F. McColl. Bulk synchronous parallel computing. InJohn R. Davy and Peter M. Dew, editors, Abstract Machine Models for HighlyPar allel Computers, pages 41–63. Oxford University Press, 1995.

    Google Scholar 

  9. C. Slot and P. van Emde-Boas. On tape versus core; an application of space efficientperfect hash function to the invariance of space. In Proceedings of STOC’84, pages391–400, Washington D.C., 1984.

    Google Scholar 

  10. L. G. Valiant. A bridging model for parallel computation. Communications of theACM, 33(8):103–111, 1990.

    Article  Google Scholar 

  11. P. van Emde Boas. Machine models and simulations. InJan van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A, pages 1–66. Elsevier Science Publishers, Amsterdam, 1990.

    Google Scholar 

  12. P. van Emde Boas. The second machine class, model of parallelism. InJ. van Leeuwen, J. K. Lenstra, and A. H. G.Rinnooy Kan, editors, Parallel Computersand Computations, CWI Syllabus, volume 9, pages 133–161. Centre for Mathematics and Computer Science, Amsterdam, 1985.

    Google Scholar 

  13. Jiří Wiedermann. Weak parallel machines: A new class of physically feasible parallel machine models. InI. M. Havel and V. Koubek, editors, Mathematical Foundationsof Computer Science 1992, 17th Int. Symposium (MFCS’92), LNCS 629, pp. 95–111. Springer-Verlag1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Physics, Charles University, Malostranské nám. 25, 118 00, Praha 1, the Czech Republic

    Martin Beran

Authors
  1. Martin Beran
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computer Science, University of Wroclaw, Przesmyckiego 20, 51-151, Wroclaw, Poland

    Leszek Pacholski

  2. Fac. of Mathematics, Physics, and Informatics, Inst. of Informatics, Comenius Univ., Mlynská dolina, 84248, Bratislava, Slovakia

    Peter Ružička

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Beran, M. (2001). Pipelined Decomposable BSP Computers. In: Pacholski, L., Ružička, P. (eds) SOFSEM 2001: Theory and Practice of Informatics. SOFSEM 2001. Lecture Notes in Computer Science, vol 2234. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45627-9_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-45627-9_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42912-8

  • Online ISBN: 978-3-540-45627-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics