Design of efficient and easily routable generalized connectors
- 1 February 1995
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 43 (2/3/4) , 646-650
- https://doi.org/10.1109/26.380083
Abstract
This paper presents a new generalized connector with a very simple self-routing scheme. Unlike some of the recently reported generalized connectors, this generalized connector does not rely on an explicit use of a copy network; rather it replicates packets as it routes them through its stages to their destinations. In addition to its attractive routing scheme, this generalized connector can be constructed with O(n lg/sup 2/ n) bit-level constant fanin logic gates, O(lg/sup 2/ n) bit-level depth, and can realize any multicast assignment in O(lg/sup 3/ n) bit-level time.Keywords
This publication has 5 references indexed in Scilit:
- Nonblocking broadcast switching networksIEEE Transactions on Computers, 1991
- Design of a broadcast packet switching networkIEEE Transactions on Communications, 1988
- Parallel permutation and sorting algorithms and a new generalized connection networkJournal of the ACM, 1982
- Generalized Connection Networks for Parallel Processor IntercommunicationIEEE Transactions on Computers, 1978
- Generalized multi‐stage connection networksNetworks, 1972