Journal of the ACM (JACM)
An optimal routing algorithm for mesh-connected Parallel computers
Journal of the ACM (JACM)
Parallel permutation and sorting algorithms and a new generalized connection network
Journal of the ACM (JACM)
Sorting on a mesh-connected parallel computer
Communications of the ACM
A cellular computer to implement the kalman filter algorithm
A cellular computer to implement the kalman filter algorithm
Bitonic Sort on a Mesh-Connected Parallel Computer
IEEE Transactions on Computers
Parallel Processing with the Perfect Shuffle
IEEE Transactions on Computers
Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations
IEEE Transactions on Computers
Implementation of Permutation Functions in Illiac IV-Type Computers
IEEE Transactions on Computers
Access and Alignment of Data in an Array Processor
IEEE Transactions on Computers
Generalized Connection Networks for Parallel Processor Intercommunication
IEEE Transactions on Computers
Sorting networks and their applications
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
A Shuffle-Exchange Network with Simplified Control
IEEE Transactions on Computers
A new interconnection network for SIMD computers: the sigma networks
IEEE Transactions on Computers
A New Benes Network Control Algorithm
IEEE Transactions on Computers
Unique design concepts on GF11 and their impact on performance
IBM Journal of Research and Development
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
HPCA '95 Proceedings of the 1st IEEE Symposium on High-Performance Computer Architecture
A New Tag Scheme and Its Tree Representation for a Shuffle-Exchange Network
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 01
Parallel Algorithms to Set Up the Benes Permutation Network
IEEE Transactions on Computers
Optimal BPC Permutations on a Cube Connected SIMD Computer
IEEE Transactions on Computers
Routing automorphisms of the hypercube
Information Processing Letters
Parallel routing algorithms in Benes-Clos networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
| Hi-index | 14.99 |
A Benes permutation network capable of setting its own switches dynamically is presented. The total switch setting and delay time for the N input utput self-routing network is O(log N). It is shown that the network is capable of performing a rich class of permutations. The self-routing scheme leads to efficient O(log N) parallel algorithms to perform the same class of permutations on cube connected and perfect shuffle computers.