Analysis of Permutations for Routing in Multistage Interconnection Networks.

Date of Submission

December 1988

Date of Award

Winter 12-12-1989

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Master's Dissertation

Degree Name

Master of Technology

Subject Name

Computer Science


Advance Computing and Microelectronics Unit (ACMU-Kolkata)


Das, Nabanita (ACMU-Kolkata; ISI)

Abstract (Summary of the Work)

The isomor phism af conflict graphs in multistage interconnection networks CMIN) is analyzed here. We introduce concept a called group transformation which allows us to partition the set of all permutations into several equivalence classes. All members belonging to the class have isomorphic ame conflict graphs. Finally we describe twa algorithms, one for the generation of the seed permutation for any given input permutation and the second one to generate all poss ible seeds for a given N x N base-line network.


ProQuest Collection ID:

Control Number


Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.


This document is currently not available here.