Skip to main content

Broadcasting in bus interconnection networks

  • Conference paper
  • First Online:

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

Abstract

In this paper we study parallel architectures where the communication means are constituted solely by buses. These promising architectures can use the power of bus technologies, providing a viable way to interconnect much more processors in a simple and efficient manner. We study the hyperpath, hypergrid, hyperring, and hypertorus architectures, which are the bus-based versions of the well used point-to-point interconnection networks. We give optimal algorithms for broadcasting a message from one processor to all the others in such architectures, using a tool called simplification.

Partially supported by the PRC PRS and ANM of the French CNRS.

Supported by FAPESP - Proc. No. 92/3991-0

Supported by FAPESP - Proc. No. 93/0603-1 and CNPq - Proc. No. 306063/88-3 and PROTEM-CC/SP.

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. A. Aggarwal, Optimal bounds for finding maximum on array of processors with k global buses, IEEE Transactions on Computers 35 (1986) 62–64.

    Google Scholar 

  2. A. Bar-Noy and D. Peleg, Square meshes are not always optimal, ACM Symposium on Parallel Algorithms and Architectures, (ACM, 1989) 138–147.

    Google Scholar 

  3. C. Berge, Hypergraphs, (North Holland, 1989).

    Google Scholar 

  4. J-C. Bermond, Le problème des “ouvroirs” (Hypergraph gossip problem), in Colloques Internacionaux du Centre National de la Recherche Scientifique, No. 260, Orsay, 1976, 31–34.

    Google Scholar 

  5. J-C. Bermond and F.O. Ergincan, Bus interconnection networks, Technical Report No. 93-56, Université de Nice-Sophia Antipolis, September 1993.

    Google Scholar 

  6. L.N. Bhuyan and D.P. Agrawal, Generalized hypercube and hyperbus structures for a computer network, IEEE Transactions on Computers 33 (1984) 323–333.

    Google Scholar 

  7. A.M. Farley and S.T. Hedetniemi, Broadcasting in grid graphs, In Congressus Numerantium XXI, editor, Proc. 9th S-E conf. combinatorics, graph theory, and computing, pages 275–288, 1978.

    Google Scholar 

  8. A. Ferreira, A. Goldman vel Lejbman, S.W. Song, A viable way for massive parallelism, PARLE'94 Parallel Architectures and Languages Europe (Lecture Notes of Computer Science, Springer-Verlag), Athens, July 1994. (to appear)

    Google Scholar 

  9. C.M. Fiduccia, Bused hypercubes and other pin-optimal networks, IEEE Transactions on Parallel and Distributed Systems 3(1) (1992) 14–24.

    Google Scholar 

  10. P. Fraigniaud and E. Lazard, Methods and problems of communication in usual networks, Rapport de Recherche LIP 91-33, Laboratoire de l'Informatique du Parallélisme, École Normale Supérieure de Lyon, October, 1991, to appear in Discrete Applied Mathematics.

    Google Scholar 

  11. K. Hwang, Advanced Computer Architecture: parallelism, scalability, programmability, (McGraw-Hill, 1993).

    Google Scholar 

  12. H. Jiang and K.C. Smith, PPMB: a partial-multiple-bus multiprocessor architecture with improved cost-effectiveness, IEEE Transactions on Computers 41 (1992) 361–366.

    Google Scholar 

  13. F. Meyer auf der Heide and H.T. Pham, On the performance of networks with multiple buses, STACS'92 9th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, (Springer-Verlag, 1992) 97–108.

    Google Scholar 

  14. S. Olariu, J.L. Schwing and J.Y. Zhang, On the power of two-dimensional processor arrays with reconfigurable bus systems, Parallel Processing Letters 1 (1991) 29–34.

    Google Scholar 

  15. I.D. Scherson, Orthogonal graphs for the construction of a class of interconnection networks, IEEE Transactions on Parallel and Distributed Systems 2(1) (1991) 3–18.

    Google Scholar 

  16. Q.F. Stout, Meshes with multiple buses, Proc. 27th IEEE Symposium on the Foundations of Computer Science (1986) 264–273.

    Google Scholar 

  17. T. Szymanski, Graph-theoretic models for photonic networks, Proceedings of the New Frontiers: A Workshop on Future Directions of Massively Parallel Processing, McLean, VA, 1992, 85–96.

    Google Scholar 

  18. B. Wilkinson, On crossbar switch and multiple bus interconnection networks with overlapping connectivity, IEEE Transactions on Computers 41 (1992) 738–746.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Bruno Buchberger Jens Volkert

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ferreira, A., Lejbman, A.G.v., Song, S.W. (1994). Broadcasting in bus interconnection networks. In: Buchberger, B., Volkert, J. (eds) Parallel Processing: CONPAR 94 — VAPP VI. VAPP CONPAR 1994 1994. Lecture Notes in Computer Science, vol 854. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58430-7_69

Download citation

  • DOI: https://doi.org/10.1007/3-540-58430-7_69

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48789-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics