Skip to main content

Interconnection networks based on block designs

  • Conference paper
  • First Online:
Book cover Parallel Processing: CONPAR 92—VAPP V (VAPP 1992, CONPAR 1992)

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

Abstract

We discuss a method constructing efficient multiprocessor networks based on combinatorial designs. The principal goal is to reduce the network diameter while keeping the number of processor ports small. With a smart multiplexing technique and the use of a class of bipartite graphs we are able to construct e.g. a 1210 processor machine with 4 ports/processor and diameter 2.

This work was done at the Institute for Algorithms und Cognitive Systems, University of Karlsruhe.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. C. Bermond, J.Bond, M.Paoli, C. Peyrat, “Graphs and Interconnection Networks: Diameter and Vulnerability”, in Proceedings of the Ninth British Combinatorial Conference, 1983, pp.1–30

    Google Scholar 

  2. T. Beth, D. Jungnickel, H. Lenz, “Design Theory”, B.I.-Wissenschaftsverlag, 1985

    Google Scholar 

  3. T. Beth, V. Hatz, “A Restricted Crossbar Implementation and its Applications”, ACM Computer Architecture News, Vol. 19, December 1991

    Google Scholar 

  4. T. Beth, V. Hatz, “Design Machines: Algebraically Well Described Interconnection Networks”, to appear in Journal on Designs, Codes and Cryptography

    Google Scholar 

  5. C. J.Colbourn, P. C. van Oorschot, “Applications of Combinatorial Designs in Computer Science”, ACM Computing Surveys, Vol.21, No.2, June 1989

    Google Scholar 

  6. C. Wu, T. Feng, “Tutorial: Interconnection Networks for Parallel and Distributed Processing”, Computer Society Press, 1984

    Google Scholar 

Download references

Authors

Editor information

Luc Bougé Michel Cosnard Yves Robert Denis Trystram

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hatz, V. (1992). Interconnection networks based on block designs. In: Bougé, L., Cosnard, M., Robert, Y., Trystram, D. (eds) Parallel Processing: CONPAR 92—VAPP V. VAPP CONPAR 1992 1992. Lecture Notes in Computer Science, vol 634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55895-0_395

Download citation

  • DOI: https://doi.org/10.1007/3-540-55895-0_395

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics