Skip to main content

Nested Bulk Synchronous Parallel Computing

  • Conference paper
  • First Online:
Recent Advances in Parallel Virtual Machine and Message Passing Interface (EuroPVM/MPI 1999)

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

  • 434 Accesses

Abstract

The BSP model can be extended with the inclusion of processor sets. In this model, processor sets can be divided and processor sets synchronize through Collective operations. The study of optimal policies for the implementation of the Division Functions lead us to the concept of dynamic polytope. The advantages of the model are exemplified through the divide and conquer paradigm. Computational results for two instances of this paradigm in three parallel machines are presented.

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

Access this chapter

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. Valiant, L. G.: A Bridging Model for Parallel Computation. Communications of the ACM, Vol. 33(8), (1990) 103–111

    Article  Google Scholar 

  2. de Sande, F.: 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. Universidad de La Laguna, (1998)

    Google Scholar 

  3. Hill, J., McColl, B., Stefanescu, D., Goudreau, M., Lang, K., Rao, B., Suel, T., Tsantilas, Bisseling, R.: BSPLib: The BSP Programming Library. Technical Report PRG-TR-29-97, Oxford University Computing Laboratory (1997). http://www.bsp-worldwide.org

  4. Akl, S. G.: The Design and Analysis of Parallel Algorithms. Prentice-Hall (1989)

    Google Scholar 

  5. Hoare, C. A. R.: Algorithm 64: Quicksort. Communications of the ACM Vol. 4, 321 (1961)

    Article  Google Scholar 

  6. Preparata, F. P., Shamos, M. I.: Computational Geometry. An Introduction. Springer-Verlag, New York (1985)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Sande, F., León, C., Rodríguez, C., Roda, J., González, J.A. (1999). Nested Bulk Synchronous Parallel Computing. In: Dongarra, J., Luque, E., Margalef, T. (eds) Recent Advances in Parallel Virtual Machine and Message Passing Interface. EuroPVM/MPI 1999. Lecture Notes in Computer Science, vol 1697. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48158-3_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-48158-3_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66549-6

  • Online ISBN: 978-3-540-48158-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics