Elsevier

Information Sciences

Volume 44, Issue 1, February 1988, Pages 51-69
Information Sciences

Realization of permutations on generalized INDRA networks

https://doi.org/10.1016/0020-0255(88)90056-4Get rights and content

Abstract

The realization of permutations of data on a class of redundant-path interconnection networks, called generalized INDRA networks, is studied. This class of networks is constructed by combining L layers (copies) of subnetworks in parallel preceded by a distribution stage, the subnetwork chosen being a delta network constructed from R × R switching elements. Redundant links are provided on the input side of the network so that failures in the distribution stage could be sustained. The problem of realizing an arbitrary permutation on such networks has a one-to-one correspondence with the problem of performing the same permutation in multiple passes on a delta network. This problem is reduced to that of finding a vertex coloring for the conflict graph of the permutation. Although the general problem of finding optimal colorings for graphs of arbitrary permutations is unsolved, classes of permutations with some regularity can be mapped optimally; we illustrate this with the BPC class of permutations. Conflicts in a permutation in the BPC class are described by means of conflict cubes, and these cubes are used to obtain an optimal mapping of the permutation on the network using a minimum number of layers. Several examples are provided to illustrate the underlying concepts of our work.

References (20)

  • G.B. Adams et al.

    The extra-stage cube: A fault-tolerant interconnection network for supersystems

    IEEE Trans. Comput.

    (May 1982)
  • D.P. Agrawal

    Graph theoretical analysis and design of multistage interconnection networks

    IEEE Trans. Comput.

    (July 1983)
  • V.E. Beneš

    Mathematical Theory of Connecting Networks and Telephone Traffic

    (1965)
  • C. Berge

    Graphs and Hypergraphs

    (1973)
  • C.Y. Chin et al.

    Connection principles for multipath packet switching networks

  • T.Y. Feng

    A survey of interconnection networks

    Computer

    (Dec. 1981)
  • M. Kumar et al.

    Generalized delta networks

  • D.H. Lawrie

    Access and alignment of data in an array processor

    IEEE Trans. Comput.

    (Dec. 1975)
  • J. Lenfant

    Parallel permutations of data: A Benes network control algorithm for frequently used permutations

    IEEE Trans. Comput.

    (July 1978)
  • D. Nassimi et al.

    Optimal BPC permutations on a cube connected computer

    IEEE Trans. Comput.

    (Apr. 1982)
There are more references available in the full text version of this article.

Cited by (0)

This research is supported by the NSF Presidential Young Investigator Award No. ECS-8452003, an AT&T Grant, and DARPA/ARO Contract No. DAAG 29-84-K-0066. A preliminary version of this paper was presented at the International Conference in Parallel Processing, St. Charles, Ill., August 1985.

This research was performed while the author was at the University of Southern California.

View full text