Skip to main content
SpringerLink
Log in

Multi-node Broadcasting in All-Ported 3-D Wormhole-Routed Torus Using Aggregation-then-Distribution Strategy

  • Conference paper
  • First Online:
High Performance Computing (ISHPC 2000)

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

Included in the following conference series:

  • 613 Accesses

Abstract

In this paper, we investigate the multi-node broadcasting problem in a all-ported 3-D wormhole-routed torus. The main technique used in this paper is based on a proposed aggregation-then-distribution strategy. Extensive simulations are conducted to evaluate the multibroadcasting algorithm.

This work was supported by the National Science Council, R.O.C., under Contract NSC88-2213-E-216-011.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Y. S. Chen, T. Y. Juang, and E. H. Tseng. Efficient broadcasting in an arrangement graph using multiple spanning trees. IEICE Transactions on Fundamentals of Electronic, Communications, and Computer Science, E83-A(1):139–149, January 2000.

    Google Scholar 

  2. F. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays-Trees-Hypercubes. Morgan Kaufmann Publishers, San Mateo, California, 1992.

    MATH  Google Scholar 

  3. Y. Saad and M. Schultz. Data communication in hypercubes. Journal of Parallel and Distributed Computing, 6(1):115–135, February 1989.

    Article  Google Scholar 

  4. Y. Saad and M. Schultz. Data communication in parallel architectures. Parallel Computing, 11:131–150, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  5. George D. Stamoulis and John N. Tsitsiklis. An effiicient algorithm for multiple simultaneous broadcasts in the hypercube. Information Processing Letter, 46:219–224, July 1989.

    Google Scholar 

  6. Y. C. Tseng. Multi-node broadcasting in hypercubes and star graph. Journal of Information Science and Engineering, 14(4):809–820, 1998.

    MathSciNet  Google Scholar 

  7. S. Y. Wang and Y. C. Tseng. Algebraic foundations and broadcasting algorithms for wormhole-routed all-port tori. To appear in IEEE Transactions on Computers, 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Statistic, National Taipei University, 10433, Taipei, Taiwan, R.O.C.

    Yuh-Shyan Chen & Che-Yi Chen

  2. Department of Computer Science and Information Engineering, National Central University, Chungli, Taiwan, R.O.C.

    Yu-Chee Tseng

Authors
  1. Yuh-Shyan Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Che-Yi Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yu-Chee Tseng
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departamento de Arquitectura de Computadores, Universidad Politecnica de Catalunya, Spain

    Mateo Valero

  2. Department of Information and Computer Sciences, Nara Women’s University, Japan

    Kazuki Joe

  3. Institute of Industrial Science Center for Conceptual Information Processing Research, University of Tokyo, Japan

    Masaru Kitsuregawa

  4. Graduate School of Engineering Electrical Engineering Department, University of Tokyo, Japan

    Hidehiko Tanaka

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, YS., Chen, CY., Tseng, YC. (2000). Multi-node Broadcasting in All-Ported 3-D Wormhole-Routed Torus Using Aggregation-then-Distribution Strategy. In: Valero, M., Joe, K., Kitsuregawa, M., Tanaka, H. (eds) High Performance Computing. ISHPC 2000. Lecture Notes in Computer Science, vol 1940. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39999-2_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-39999-2_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41128-4

  • Online ISBN: 978-3-540-39999-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation