Journal of the ACM (JACM)
Sorting on a mesh-connected parallel computer
Communications of the ACM
Banyan networks for partitioning multiprocessor systems
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
Parallel Processing with the Perfect Shuffle
IEEE Transactions on Computers
Implementation of Permutation Functions in Illiac IV-Type Computers
IEEE Transactions on Computers
Sorting networks and their applications
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
Permutations on Illiac IV-Type Networks
IEEE Transactions on Computers
A Class of Interconnection Networks for Multicasting
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
The Necessary Conditions for Clos-Type Nonblocking Multicast Networks
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
A journey into multicomputer routing algorithms
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
Parallel Algorithms to Set Up the Benes Permutation Network
IEEE Transactions on Computers
Binary Trees and Parallel Scheduling Algorithms
IEEE Transactions on Computers
Notes on Shuffle/Exchange-Type Switching Networks
IEEE Transactions on Computers
Communication Structures for Large Networks of Microcomputers
IEEE Transactions on Computers
A Self-Routing Benes Network and Parallel Permutation Algorithms
IEEE Transactions on Computers
Graph Theoretical Analysis and Design of Multistage Interconnection Networks
IEEE Transactions on Computers
Expected Capacity of (m2)-Networks
IEEE Transactions on Computers
Construction of a Generalized Connector with 5.8 n log2n Edges
IEEE Transactions on Computers
Packet Switching Networks for Multiprocessors and Data Flow Computers
IEEE Transactions on Computers
IEEE Transactions on Computers
Hypertree: A Multiprocessor Interconnection Topology
IEEE Transactions on Computers
Design and implementation of the banyan interconnection network in TRAC
AFIPS '80 Proceedings of the May 19-22, 1980, national computer conference
Data broadcasting in SIMD computers
IEEE Transactions on Computers
| Hi-index | 15.02 |
A generalized connection network (GCN) is a switching network with N inputs and N outputs that can be set to pass any of the NNmappings of inputs onto outputs. This paper demonstrates an intimate connection between the problems of GCN construction, message routing on SIMD computers, and "resource partitioning." A GCN due to Ofman [7] is here improved to use less than 7.6N log N contact