Self-Routing Technique in Perfect-Shuffle Networks Using Control Tags

Authors:
S. -T. Huang;S. K. Tripathi
Affiliations:
-;-
Venue:
IEEE Transactions on Computers
Year:
1988

Citing 5
Cited 3

A Unified Approach to a Class of Data Movements on an Array Processor

IEEE Transactions on Computers
Finite State Model and Compatibility Theory: New Analysis Tools for Permutation Networks

IEEE Transactions on Computers
An optimal routing algorithm for mesh-connected Parallel computers

Journal of the ACM (JACM)
A cellular computer to implement the kalman filter algorithm

A cellular computer to implement the kalman filter algorithm
On shuffle-exchange type interconnection networks for multiprocessor systems (permutation, interconnection topology, routing technique, addressing scheme, resource scheduling)

On shuffle-exchange type interconnection networks for multiprocessor systems (permutation, interconnection topology, routing technique, addressing scheme, resource scheduling)

Reduced distance routing in single-state shuffle-exchange interconnection networks

SIGMETRICS '87 Proceedings of the 1987 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Notes on Shuffle/Exchange Type Permutation Sets

IEEE Transactions on Computers
An Efficient Routing Algorithm for Realizing Linear Permutations on p/sup t/-Shuffle-Exchange Networks

IEEE Transactions on Computers

Quantified Score

Hi-index	15.00

Visualization

Abstract

The self-routing technique using control tags on multiple-pass perfect-shuffle networks is generalized. In particular, they show that bit-permute-complement permutations can be realized and unscrambled in (2n-1) passes or less, where n=log/sub 2/N, N being the number of terminals on either side. They also show that most of the frequently used permutations are in the intersection of omega-realizing and inverse-omega-realizing sets and can be realized and unscrambled in n passes.