IEEE Transactions on Communications · 1991 · 115 citations · 7 references
ComputingComputer EngineeringComputer ScienceFault ToleranceFault-tolerant ComputingFault-tolerant SystemsCircuit SwitchingNetwork SwitchingRoutingSwitching TechniquesFault Tolerance In Switching NetworksFault Tolerance MechanismsFault-tolerant NetworksFault-tolerant SwitchingNonblocking NetworksRearrangeable NetworksRearrangeably Nonblocking NetworksSelf-routing
A class of rearrangeable nonblocking networks is presented. The proposed networks are fault-tolerant, self-routing, and intended for a very-high-speed environment. Self-routing networks have one major problem when applied to switching: they are blocking networks. To solve this problem, two methods have been used to create self-routing rearrangeable nonblocking networks: horizontal cascading (HC) and vertical stacking (VS). The authors unify the two approaches and propose a novel class of switching networks. The proposed design principle allows the best tradeoffs among design parameters such as fault tolerance, hardware cost, and the frequency of rearrangement activities. A study of the frequency of rearrangement activities is also presented.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
7
Parallel Processing with the Perfect Shuffle
Harold S. Stone · IEEE Transactions on Computers · 1971 · 1.3K citations
Banyan networks for partitioning multiprocessor systems
L. Rodney Goke, G. Jack Lipovski · 1998 · 512 citations
Banyan networks for partitioning multiprocessor systems
L. Rodney Goke, G. Jack Lipovski · 1973 · 382 citations