Skip to main content
SpringerLink
Log in

Decomposable Bulk Synchronous Parallel Computers

  • Conference paper
  • First Online:
Book cover SOFSEM’99: Theory and Practice of Informatics (SOFSEM 1999)

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

Abstract

The Bulk Synchronous Parallel (BSP) computer is a generally accepted realistic model of parallel computers introduced by Valiant in 1990. We present an extension to the BSP model - a decomposable BSP (dBSP for short). Performance of several elementary algorithms, namely broadcasting, prefix computation, and matrix multiplication, is analyzed on BSP and dBSP models. For a suitable setting of parameters, these algorithms run asymptotically faster on dBSP than on BSP. We also show how space-bounded sequential algorithms can be transformed into pipelined ones with bounded period on dBSP. Such a transformation is proved impossible for the BSP model. Finally, we present an algorithm for the simulation of dBSP on BSP.

This research was supported by the GA ČR grant No. 201/98/0717.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. Martin Beran. Computational Power of BSP Computers. In Proceedings of SOFSEM’ 98, volume 1521 of Lecture Notes in Computer Science, pages 285–293. Springer-Verlag, 1998.

    Google Scholar 

  2. Alexandros V. Gerbessiotis and Constantinos J. Siniolakis. Primitive Operations on the BSP Model. Technical Report PRG-TR-23-96, Oxford University Computing Laboratory, Oxford, October 1996.

    Google Scholar 

  3. Alexandros V. Gerbessiotis and Leslie G. Valiant. Direct Bulk-Synchronous Parallel Algorithms. Journal of Parallel and Distributed Computing, 22:251–267, 1994.

    Article  Google Scholar 

  4. Mark Goudreau, Kevin Lang, Satish Rao, Torsten Suel, and Thanasis Tsantilas. Towards Efficiency and Portability: Programming with the BSP Model. In SPAA’ 96: Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 1–12. ACM Press, 1996.

    Google Scholar 

  5. T. Heywood and S. Ranka. A Practical Hierarchical Model of Parallel Computation: I and II. Journal of Parallel and Distributed Computing, 16:212–249, November 1992.

    Article  MATH  MathSciNet  Google Scholar 

  6. B. H. H. Juurlink and H. A. G. Wijsho. Communication Primitives for BSP Computers. Information Processing Letters, 58:303–310, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  7. Ben H. H. Juurlink and Harry A. G. Wijsho. The E-BSP Model: Incorporating General Locality and Unbalanced Communication into the BSP Model. In Proceedings of Euro-Par’96 (Vol. II), Volume 1124 of Lecture Notes in Computer Science. Springer-Verlag, 1996.

    Google Scholar 

  8. Klaus-Jörn Lange. On the Distributed Realization of Parallel Algorithms. In Proc. of SOFSEM’97, Volume 1338 of Lecture Notes in Computer Science, pages 37–52. Springer-Verlag, 1997.

    Google Scholar 

  9. W. F. McColl. Bulk Synchronous Parallel Computing. In John R. Davy and Peter M. Dew, editors, Abstract Machine Models for Highly Parallel Computers, pages 41–63. Oxford University Press, 1995.

    Google Scholar 

  10. W. F. McColl. Scalable Computing. Lecture Notes in Computer Science, 1000: 46–61, 1995.

    Google Scholar 

  11. Rolf Niedermeier. Towards Realistic and Simple Models of Parallel Computation. PhD thesis, Fakultät für Informatik, Eberhard-Karls=Universität Tübingen, Tübingen, 1996. http://www-fs.informatik.uni-tuebingen.de/ niedermr/publications/di2.ps.Z

    MATH  Google Scholar 

  12. Oxford BSP research group. http://www.comlab.ox.ac.uk/oucl/groups/bsp/

  13. Constantinos J. Siniolakis. On the Complexity of BSP Sorting. Technical Report PRG-TR-09-96, Oxford University Computing Laboratory, 1996. http://www.comlab.ox.ac.uk/oucl/users/constantinos.siniolakis/index.html

  14. Leslie G. Valiant. A Bridging Model for Parallel Computation. Communications of the ACM, 33(8):103–111, 1990.

    Article  Google Scholar 

  15. P. van Emde Boas. Machine Models and Simulations. Handbook of Theoretical Computer Science, A:1–66, 1990.

    Google Scholar 

  16. Jiří Wiedermann. Weak Parallel Machines: A New Class of Physically Feasible Parallel Machine Models. In I. M. Havel and V. Koubek, editors, Mathematical Foundations of Computer Science 1992, 17th Int. Symposium (MFCS’92), Volume 629 of Lecture Notes in Computer Science, pages 95–111, Berlin, 1992. Springer-Verlag.

    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, 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. DCIT, s.r.o, J. Martího 2/407, 162 02, Prague 6, Czech Republic

    Jan Pavelka

  2. Department of Computer Science, University of Utrecht, Padualaan 14, 3584, CH, Utrecht, The Netherlands

    Gerard Tel

  3. Institute of Computer Science, Masaryk University, Botanická 68a, 602 00, Brno, Czech Republic

    Miroslav Bartošek

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Beran, M. (1999). Decomposable Bulk Synchronous Parallel Computers. In: Pavelka, J., Tel, G., Bartošek, M. (eds) SOFSEM’99: Theory and Practice of Informatics. SOFSEM 1999. Lecture Notes in Computer Science, vol 1725. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47849-3_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-47849-3_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66694-3

  • Online ISBN: 978-3-540-47849-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation