Skip to main content
Springer Nature Link
Log in

Design machines: Algebraically well described interconnection networks

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

We present a method constructing efficient multiprocessor networks based on combinatorial designs and group theory. The principal idea is to combine 1-factorizations of complete graphs on each block of certain 2-designs, to obtain efficient networks with a short maximum distance between any pair of processors. Using a smart multiplexing technique derived from the 1-factorization of complete graphs we can circumvent the restrictive Moore bound for (Δ, d)-graphs.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. L.D. Baumert, Cyclic difference sets, Springer-Verlag, Berlin, Heidelberg, (1971).

    Google Scholar 

  2. 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.

  3. J.C. Bermond, C. Delorme, J.-J. Quisquater, Strategies for interconnection networks: some methods from graph theory, Journal of Parallel and Distributed Computing, Vol. 3 (1986), pp. 433–449.

    Google Scholar 

  4. T. Beth, On resolutions of steiner systems, Mitt. Math. Sem. Giessen, Vol. 136 (1979), pp. 1–103.

    Google Scholar 

  5. T. Beth, D. Jungnickel, H. Lenz, Design theory, B.I.-Wissenschaftsverlag, (1985).

  6. P.J. Cameron, Parallelisms of complete designs, Cambridge University Press, Cambridge (1976).

    Google Scholar 

  7. C.J. Colbourn, P.C. van Oorschot, Applications of combinatorial designs in computer science, ACM Computing Surveys, Vol. 21, June (1989).

  8. M. Hall, Jr., Combinatorial Theory, John Wiley & Sons, New York, (1986).

    Google Scholar 

  9. F. Harary, Graph Theory, Addison-Wesley, Reading, MA, (1969).

    Google Scholar 

  10. inmos, Transputer reference manual, Prentice-Hall, Englewood Cliffs, NJ, (1988).

  11. D.A. Reed, R.M. Fujimoto, Multicomputer networks, MIT Press, Cambridge, MA (1987).

    Google Scholar 

  12. T. Tsuzuku, Finite groups and finite geometries, Cambridge University Press, Cambridge, MA, (1982).

    Google Scholar 

  13. C. Wu, T. Feng, Tutorial: interconnection networks for parallel and distributed processing, Computer Society Press, (1984).

Download references

Author information

Authors and Affiliations

  1. Institute of Algorithms and Cognitive Systems, Faculty of Computer Science, University of Karlsruhe, Am Fasangarten 5, W7500, Karlsruhe, Germany

    Thomas Beth & Volker Hatz

Authors
  1. Thomas Beth
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Volker Hatz
    View author publications

    You can also search for this author inPubMed Google Scholar

Additional information

Communicated by D. Jungnickel

Rights and permissions

Reprints and permissions

About this article

Cite this article

Beth, T., Hatz, V. Design machines: Algebraically well described interconnection networks. Des Codes Crypt 2, 287–298 (1992). https://doi.org/10.1007/BF00141973

Download citation

  • Received:

  • Issue Date:

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

Keywords