On the design of interconnection networks for parallel and multiprocessor systems
On the design of interconnection networks for parallel and multiprocessor systems
The Indirect Binary n-Cube Microprocessor Array
IEEE Transactions on Computers
Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations
IEEE Transactions on Computers
Access and Alignment of Data in an Array Processor
IEEE Transactions on Computers
Performing BMMC Permutations in Two Passes through the Expanded Delta Network and MasPar MP-2
FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
Performance and reliability analysis of new fault-tolerant advance omega network
WSEAS Transactions on Computers
A new min: fault-tolerant advance omega network
ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
| Hi-index | 14.98 |
A p network, which is a concatenation of 2 O networks [2], along with a simple control algorithm is proposed. This network is capable of performing all O network realizable permutations and the bit-permute-complement (BPC) class of permutations[5] in 0(log N) time. The control algorithm is actually a multiple-pass control algorithm on the O network, which is more general than Pease's LU decomposition method [6] and Lenfant's decomposition method[4].