SCOQ: a fast packet switch with shared concentration and output queueing
IEEE/ACM Transactions on Networking (TON)
Self-routing superconcentrators
Journal of Computer and System Sciences
Algebraic switching theory and broadband applications
Algebraic switching theory and broadband applications
Banyan networks for partitioning multiprocessor systems
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
Access and Alignment of Data in an Array Processor
IEEE Transactions on Computers
Fast knockout algorithm for self-route concentration
Computer Communications
| Hi-index | 0.00 |
Multistage interconnection networks (MINs) are commonly deployed in sorting, switching, and other applications. Arithmetic over MINs for various applications is hereby unified in algebra. The key is to structure the signal alphabet as a distributive lattice instead of an ordered set. The theoretic unification enhances the mathematical understanding of properties of MINs and, in particular, demystifies various 0-1 principles. Conventional applications of MINs are all for point-to-point transmissions, while the unified theory applies to multicasting as well. The Multicast Concentrator Theorem is generalized into the Boolean Concentrator Theorem, which is useful in recursive construction of multicast switches with the feature of priority treatment. Meanwhile, the concomitant theory of cut-through coding is introduced for delay-free signal propagation through a MIN.