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 language | English (US) |
---|---|
Title of host publication | Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors |
Editors | Anon |
Publisher | IEEE Computer Society |
Pages | 452-455 |
Number of pages | 4 |
State | Published - 1989 |
Event | Proceedings - 1989 IEEE International Conference on Computer Design: VLSI in Computers & Processors - Cambridge, MA, USA Duration: Oct 2 1989 → Oct 4 1989 |
Other
Other | Proceedings - 1989 IEEE International Conference on Computer Design: VLSI in Computers & Processors |
---|---|
City | Cambridge, MA, USA |
Period | 10/2/89 → 10/4/89 |
ASJC Scopus subject areas
- Hardware and Architecture
- Electrical and Electronic Engineering
- General Engineering