Skip to main content
SpringerLink
Log in
Book cover

Workshop on wide area networks and high performance computing pp 297–305Cite as

Broadcast communication in ATM computer networks and mathematical algorithm development

  • Conference paper
  • First Online:

  • 53 Accesses

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 249))

Abstract

This article emphasizes the importance of collective communication and especially broadcasts in mathematical algorithms. It points out that algorithms in discrete mathematics usually transmit higher amounts of data faster than typical floating point algorithms. It describes the o.tel.o ATM Testbed of the GMD National Research Center for Information Technology, St. Augustin, and the Institute of Experimental Mathematics, Essen, and the experiences with distributed computing in this network. It turns out that the current implementations of IP over ATM and libraries for distributed computing are not yet suited for high performance computing. However, ATM itself is able to perform fast broad- or multicasts. Hence it might be worthwhile to design a message passing library based on native ATM.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Matthias Brune, Jörn Gehring, and Alexander Reinefeld. Communicating across parallel message-passing environments. Preprint submitted to Elsevier, February 1998.

    Google Scholar 

  2. P. Fleischmann, G. O. Michler, P. Roelse, J. Rosenboom, R. Staszewski, C. Wagner, and M. Weller. Linear Algebra over Small Finite Fields on Parallel Machines, volume 23 of Vorlesungen aus dem Fachbereich Mathematik. University of Essen, 1995.

    Google Scholar 

  3. Peter Roelse. Factoring high-degree polynomials over F 2 with Niederreiter's algorithm on the IBM-SP/2. Math. Comp. to appear.

    Google Scholar 

  4. M. Weller. Parallel gaussian elimination over small finite fields. In Procedings of the 9th International Conference on Parallel and Distributed Computing Systems. ISCA, September 1996.

    Google Scholar 

  5. Michael Weller. Construction of large permutation representations for matrix groups. In E. Krause and W. Jäger, editors, High Performance Computing in Science and Engineering’ 98, pages 430–452. HLRS Stuttgart, Springer-Verlag Berlin, Heidelberg, New York, 1998.

    Google Scholar 

  6. Michael Weller. Construction of large permutation representations for matrix groups II. Submitted, 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Experimental Mathematics, Ellernstr. 29, 45326, Essen, Germany

    Michael Weller

Authors
  1. Michael Weller
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

G. Cooperman (Professor)E. Jessen (Professor)G. Michler (Professor)

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag London Limited

About this paper

Cite this paper

Weller, M. (1999). Broadcast communication in ATM computer networks and mathematical algorithm development. In: Cooperman, G., Jessen, E., Michler, G. (eds) Workshop on wide area networks and high performance computing. Lecture Notes in Control and Information Sciences, vol 249. Springer, London. https://doi.org/10.1007/BFb0110095

Download citation

  • DOI: https://doi.org/10.1007/BFb0110095

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-85233-642-4

  • Online ISBN: 978-1-84628-578-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation