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 J-machine multicomputer: an architectural evaluation
ISCA '93 Proceedings of the 20th annual international symposium on computer architecture
A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems
A comprehensive analytical model for wormhole routing in multicomputer systems
Journal of Parallel and Distributed Computing
A Cost and Speed Model for k-ary n-Cube Wormhole Routers
IEEE Transactions on Parallel and Distributed Systems
A Performance Model for Duato's Fully Adaptive Routing Algorithm in k$k$-Ary n$n$-Cubes
IEEE Transactions on Computers
Analysis of fully adaptive wormhole routing in tori
Parallel Computing
An Analytical Model of Adaptive Wormhole Routing in Hypercubes in the Presence of Hot Spot Traffic
IEEE Transactions on Parallel and Distributed Systems
Analytical Modeling of Wormhole-Routed k-Ary n-Cubes in the Presence of Hot-Spot Traffic
IEEE Transactions on Computers
Impact of Virtual Channels and Adaptive Routing on Application Performance
IEEE Transactions on Parallel and Distributed Systems
Limits on Interconnection Network Performance
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Analysis of k-ary n-cubes with dimension-ordered routing
Future Generation Computer Systems - Selected papers from CCGRID 2002
Modeling Latency in Deterministic Wormhole-Routed Hypercubes under Hot-Spot Traffic
The Journal of Supercomputing
Feasibility analysis of messages for on-chip networks using wormhole routing
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Special section: systems performance analysis and evaluation
Future Generation Computer Systems - Systems performance analysis and evaluation
A Virtual Ring Method for Building Small-World Structured P2P Overlays
IEEE Transactions on Knowledge and Data Engineering
Hi-index | 0.00 |
Existing research has most often relied on simulation and considered the uniform traffic distribution when investigating the performance properties of multicomputer networks (e.g. the torus). However, there are numerous parallel applications that generate non-uniform traffic patterns, such as hot-spot. Furthermore, much more attention has been paid to capturing the impact of non-uniform traffic on network performance, resulting in the development of a number of analytical models for predicting message latency in the presence of hot-spots in the network. For instance, analytical models have been reported for the adaptively-routed torus with uni-directional as well as bi-directional channels. However, models for the deterministically-routed torus have considered uni-directional channels only. In an effort to fill in this gap, this paper describes an analytical model for the deterministically-routed torus with bi-directional channels when subjected to hot-spot traffic. The modelling approach adopted for deterministic routing is totally different from that for adaptive routing due to the inherently different nature of the two types of routing. The validity of the model is demonstrated by comparing analytical results against those obtained through extensive simulation experiments.