A Study on Shuffle-Exchange Networks.

Date of Submission

December 1997

Date of Award

Winter 12-12-1998

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)

It has been known that shuffle-exchange connection provides efficient inter- connection scheme for parallel computation of many problems. In our work both dynamic and static Shuffle-Exchange networks have been studied.Firstly we have considered dynamic shuffle-exchange network. A single stage Shuffle Exchange network is an interconnection between N inputs and N out puts with N/2 2*2 switching elements having a shuffle interconnection at the input. To realize any N*N permutation from N inputs to N outputs i passes may be needed through this single stage shuffle exchange network (single stage multipass tech- nique) where 1≤ i ≤ 2n -1,, n = log, N.In our work we have characterise set of permutations realizable in i passes (1≤ i ≤ 2n - 1) through a single sage multipass shuffe exchange network and given any permutation the above che- + teristics are made use of to find the minimum number of passes required to r the permutation.We have also studied static shuffle network topology where given any number of nodes N,we have tried to find out the most suitable arrangement of it as n * k Shuffle-Exchange network,where n=2M is the number of nodes in a stage and k is the number of stages to give the lowest possible diameter.We have simulated the values of diameter and average diameter for a given value of N with different n.


ProQuest Collection ID: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:28843087

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.