Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
Performance Analysis of k-ary n-cube Interconnection Networks
IEEE Transactions on Computers
The network architecture of the Connection Machine CM-5 (extended abstract)
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Randomized routing and sorting on fixed-connection networks
Journal of Algorithms
A comprehensive analytical model for wormhole routing in multicomputer systems
Journal of Parallel and Distributed Computing
Meiko CS-2 interconnect Elan-Elite design
Parallel Computing - Special double issue: SUPRENUM and GENESIS
IEEE Transactions on Parallel and Distributed Systems
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Analytically Modeling a Fault-Tolerant Messaging Protocol
IEEE Transactions on Computers
A performance model for analysis of heterogeneous multi-cluster systems
Parallel Computing
Design of an asynchronous switch based on butterfly fat-tree for network-on-chip applications
PCM'05 Proceedings of the 6th Pacific-Rim conference on Advances in Multimedia Information Processing - Volume Part II
| Hi-index | 0.00 |
A performance model for wormhole routed interconnection networks is presented and applied to the butterfly fat-tree network. Experimental results agree very closely over a wide range of load rate. Novel aspects of the model, leading to accurate and simple performance predictions, include (1) use of multiple-server queues, and (2) a general method of correcting queuing results based on Poisson arrivals to apply to wormhole routing. These ideas can also be applied to other networks.