Skip to main content
SpringerLink
Log in

Generalized shuffle-exchange networks

A brief summary

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

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

  • 185 Accesses

Abstract

A class of generalized Shuffle-Exchange (SE) graphs is introduced. As permutation networks these have the same functionality as the classical SE net (and contains it as a special case), but some of them possess recursive structures lacking in the classical SE net. This allow them to be constructed from identical or a small number of different building blocks and make them very attractive from a hardware-design point of view. For an extensive account of these graphs and their mathematical properties the reader is referred to [11].

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Beneš V.E., Mathematical Theory of Connecting Networks and Telephone Traffic, New York: Academic Press 1965.

    Google Scholar 

  2. Bermond J-C., Peyrat C.: The deBruijn and Kautz Networks: A Competiton for the Hypercube?. in Proc. of Hypercube and Distributed Computers, 1989, pp. 279–291.

    Google Scholar 

  3. Fredricksen H.: Lechtures on Recursion, unpublished lechture notes, University of Bergen, 1970.

    Google Scholar 

  4. Golomb S.W.: Shift Register Sequences, Holden-Day, San Francisco 1967 (224 pp.).

    Google Scholar 

  5. Guckenheimer J.: A Brief Introduction to Dynamical Systems, Lectures in Appl. Math. Vol. 17, pp.187–253, 1979.

    Google Scholar 

  6. Huang S-T., Tripathi S.K.: Self-Routing Technique in Perfect-Shuffle Networks Using Control Tags, IEEE Trans. Comput., vol. 37, pp. 251–256, no. 2 Feb. 1988.

    Google Scholar 

  7. Kleitman A., Leighton F.T., Lepley M., Miller G.L.: An Asymptotically Optimal Layout for the Shuffle-Exchange Graph, J. of Computer and Systems Sciences 26, 339–361 (1983).

    Google Scholar 

  8. Leighton F.T.: Introduction to Parallel Algorithms and Architectures, Morgan Kaufman Publ., San Mateo, Calif. 1992. (831 pp).

    Google Scholar 

  9. Lenfant J.: Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations, IEEE Trans. Comput., vol. C-27,pp. 637–647, no. 7 July 1978.

    Google Scholar 

  10. Munthe-Kaas H.: Practical Parallel Permutation Procedures, to appear.

    Google Scholar 

  11. Munthe-Kaas H.: Generalized Shuffle Exchange Networks, Dept. of Informatics, Univ. of Bergen, Rep. no. 61, June 1992, ISSN 0333-3590.

    Google Scholar 

  12. Nassimi D., Sahni S.: A Self-Routing Benes Network and Parallel Permutation Algorithms, IEEE Trans. Comput., vol. C-30,pp. 332–340, no. 5 May 1981.

    Google Scholar 

  13. Parker S.D.: Notes on Shuffle/Exchange-Type Switching Networks, IEEE Trans. Comput., vol. C-29,pp. 213–222, no. 3 March 1980.

    Google Scholar 

  14. Pradhan D.K., Samtham M.R.: The deBruijn multiprocessor network: A versatile parallel processing and sorting network for VLSI, IEEE trans. on comput. 38 (1989).

    Google Scholar 

  15. Pradhan D.K., Kodandapani K.L: A uniform Representation of Single and Multistage Interconnection Networks Used in SIMD Machines, IEEE trans. on Comp., vol. C-29, no. 9, 1980.

    Google Scholar 

  16. Preparata F.P., Vuillemin J.: The Cube-Connected Cycles: A versatile network for parallel computation, Comm. ACM vol. 24 no. 5, 1981.

    Google Scholar 

  17. Selmer E.S.: Linear Rercurrence Relations over Finite Fields, (mimeograph) Dept. of Mathematics University of Bergen, Norway, 1966, (212 pp.).

    Google Scholar 

  18. Siegel H.J.: The Theory Underlying the Partitioning of Permutation Networks, IEEE Trans. on Computers, vol. C-29, No. 9, 1980.

    Google Scholar 

  19. Stone H.S.: Parallel Processing with the Perfect Shuffle, IEEE trans. on comput. C-20, 2, (Feb 1971).

    Google Scholar 

  20. Ward M.: The Arithmetical Theory of Linear Recurring Series Trans. Amer. Math. Soc. 33 (1931), pp. 153–165.

    MathSciNet  Google Scholar 

  21. Wu C., Feng T.: The Universality of the Shuffle-Exchange Network, IEEE Trans. Comput., vol. C-30, pp. 324–331, May 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Informatics, University of Bergen, N-5020, Bergen, Norway

    Hans Munthe-Kaas

Authors
  1. Hans Munthe-Kaas
    View author publications

    You can also search for this author in PubMed Google Scholar

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

Munthe-Kaas, H. (1992). Generalized shuffle-exchange networks. 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_397

Download citation

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

  • 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

Search

Navigation