IEEE Transactions on Computers · 1988 · 13 citations · 15 references
ComputingComputer EngineeringComputer ScienceComputer NetworksCryptographyInterconnection NetworksNetwork SynthesisRoutingRouting AlgorithmsSwitching TechniquesOmega NetworksPerfect Shuffle TopologyPermutation RoutingSelf-routing
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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
15
Parallel Processing with the Perfect Shuffle
Harold S. Stone · IEEE Transactions on Computers · 1971 · 1.3K citations
The Indirect Binary n-Cube Microprocessor Array
Pease · IEEE Transactions on Computers · 1977 · 500 citations
Parallel Matrix and Graph Algorithms
Eliezer Dekel, David Nassimi, Sartaj Sahni · SIAM Journal on Computing · 1981 · 354 citations