Issue No. 02 - February (1991 vol. 40)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.73592
<p>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.</p>
setup algorithms; cube-connected parallel computers; recursive Karnaugh maps; paths; transpositions; cycles; one-pass permutations; transportations; cycles; time complexities; computational complexity; parallel algorithms.
A.Y. Sips, M. Lin, "Setup Algorithms for Cube-Connected Parallel Computers Using Recursive Karnaugh Maps", IEEE Transactions on Computers, vol. 40, no. , pp. 217-221, February 1991, doi:10.1109/12.73592