Setup Algorithms for Cube-Connected Parallel Computers Using Recursive Karnaugh Maps

Authors:
A. Yavuz Oruç;M. Mittal
Affiliations:
-;-
Venue:
IEEE Transactions on Computers
Year:
1991

Citing 5
Cited 1

The cosmic cube

Communications of the ACM - Special section on computer architecture
Interconnection networks for large-scale parallel processing: theory and case studies

Interconnection networks for large-scale parallel processing: theory and case studies
Finite State Model and Compatibility Theory: New Analysis Tools for Permutation Networks

IEEE Transactions on Computers
A microprocessor-based hypercube supercomputer

IEEE Micro
New algorithms for realizing paths and permutations through cube-connected networks

CSC '86 Proceedings of the 1986 ACM fourteenth annual conference on Computer science

Fast Self-Routing Permutation Switching on an Asymptotically Minimum Cost Network

IEEE Transactions on Computers

Quantified Score

Hi-index	14.98

Visualization

Abstract

Optimal setup procedures for cube-connected networks are described. The setup patterns include paths, transpositions, cycles, and one-pass permutations. It is shown that for an N-input cube-connected network, the procedure for paths requires O(log/sub 2/ N) steps and O(N) space, the procedure for transportations and cycles requires O(N) steps and O(N) space, and the procedure for permutations takes O(N log/sub 2/ N) steps and O(N) space. It is also shown that the time complexities of the setup procedures for transpositions, cycles, and permutations can be improved as O(log/sub 2/ N) by using O(N) processors.