IEEE Transactions on Computers · 1987 · 58 citations · 26 references
ComputingComputer EngineeringComputer ScienceComputer ArchitectureComputer NetworksInterconnection NetworksCommunication NetworksMultistage Interconnection NetworksNetwork Performance AnalysisNetwork SwitchingNetwork TopologySwitching TechniquesBanyan NetworksBlocking BehaviorBlocking PropertiesComplexityInterconnect Network DesignMemory Access PatternsMultistage Switching Networks
We present analytic models for the blocking probability of both unique path and multiple path multistage interconnection networks under the assumption of either permutation or random memory request patterns. The blocking probability of an interconnection network under the assumption of permutation requests is a quantitative measure of the network's permutation capability. We compare the performance of networks with approximately equivalent hardware complexity. It is shown that variations of banyan networks can be designed with extremely low blocking probabilities under the assumption of permutation requests.
26
A Study of Non-Blocking Switching Networks
Charles Clos · Bell System Technical Journal · 1953 · 1.7K citations
Banyan networks for partitioning multiprocessor systems
L. Rodney Goke, G. Jack Lipovski · 1998 · 512 citations