On a class of (2n - 1)-stage rearrangeable interconnection networks

J. Calvin Hsia, Chien Yi Roger Chen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A class of 2n - 1 stage rearrangeable multistage interconnection networks (MINs) that includes all the previously proposed 2n - 1 stage MINs as special cases or subsets is proposed. Both permutation routing and generalized distributed tag routing algorithms of this class of MINs are proposed. It is shown that previously proposed routing algorithms for some specific rearrangeable networks are just special cases of the general routing algorithm.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors
Editors Anon
PublisherIEEE Computer Society
Pages452-455
Number of pages4
StatePublished - 1989
EventProceedings - 1989 IEEE International Conference on Computer Design: VLSI in Computers & Processors - Cambridge, MA, USA
Duration: Oct 2 1989Oct 4 1989

Other

OtherProceedings - 1989 IEEE International Conference on Computer Design: VLSI in Computers & Processors
CityCambridge, MA, USA
Period10/2/8910/4/89

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering
  • Engineering(all)

Fingerprint Dive into the research topics of 'On a class of (2n - 1)-stage rearrangeable interconnection networks'. Together they form a unique fingerprint.

  • Cite this

    Hsia, J. C., & Chen, C. Y. R. (1989). On a class of (2n - 1)-stage rearrangeable interconnection networks. In Anon (Ed.), Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors (pp. 452-455). IEEE Computer Society.