Fat-trees: universal networks for hardware-efficient supercomputing
IEEE Transactions on Computers
A Unified theory of interconnection network structure
Theoretical Computer Science
A graph theoretical approach to equivalence of multistage interconnection networks
Discrete Applied Mathematics
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Layered cross product—a technique to construct interconnection networks
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
An O(log N) deterministic packet-routing scheme
Journal of the ACM (JACM)
Topologies of Combined (2logN - 1)-Stage Interconnection Networks
IEEE Transactions on Computers
Journal of the ACM (JACM)
Efficient algorithms for checking the equivalence of multistage interconnection networks
Journal of Parallel and Distributed Computing
Data Manipulating Functions in Parallel Processors and Their Implementations
IEEE Transactions on Computers
On the Rearrangeability of 2(Iog2N) -1 Stage Permutation Networks
IEEE Transactions on Computers
The Indirect Binary n-Cube Microprocessor Array
IEEE Transactions on Computers
On a Class of Multistage Interconnection Networks
IEEE Transactions on Computers
Access and Alignment of Data in an Array Processor
IEEE Transactions on Computers
Sorting networks and their applications
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
| Hi-index | 0.04 |
The cross-product technique, introduced by Even and Litman (1992) [8], is extended into a full decomposition theory enabling a unique (up to isomorphism) and polynomial factorization of layered interconnection networks (including many well-known networks) into a product of prime factors. A polynomial algorithm is provided for checking whether a given layered interconnection network is isomorphic to a network that is uniquely decomposable into prime factors.