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 Performance Model for Duato's Fully Adaptive Routing Algorithm in k$k$-Ary n$n$-Cubes
IEEE Transactions on Computers
An Analytical Model of Adaptive Wormhole Routing in Hypercubes in the Presence of Hot Spot Traffic
IEEE Transactions on Parallel and Distributed Systems
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
Hypercube Communication Delay with Wormhole Routing
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
Impact of Adaptivity on the Behaviour of Networks of Workstations under Bursty Traffic
ICPP '98 Proceedings of the 1998 International Conference on Parallel Processing
The Measured Network Traffic of Compiler-Parallelized Programs
ICPP '02 Proceedings of the 2001 International Conference on Parallel Processing
Entropy maximisation and open queueing networks with priorities and blocking
Performance Evaluation
A Performance Model for Wormhole-Switched Interconnection Networks under Self-Similar Traffic
IEEE Transactions on Computers
Principles and Practices of Interconnection Networks
Principles and Practices of Interconnection Networks
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Modelling of heterogeneous wireless networks under batch arrival traffic with communication locality
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
| Hi-index | 0.00 |
Analytical models for adaptive routing in multicomputer interconnection networks with the traditional non-bursty Poisson traffic have been widely reported in the literature. However, traffic loads generated by many real-world parallel applications may exhibit bursty and batch arrival properties, which can significantly affect network performance. This paper develops a new and concise analytical model for hypercubic networks in the presence of bursty and batch arrival traffic modelled by the Compound Poisson Process (CPP) with geometrically distributed batch sizes. The computation complexity of the model is independent of network size. The analytical results are validated through comparison to those obtained from the simulation experiments. The model is used to evaluate the effects of the bursty traffic with batch arrivals on the performance of interconnection networks.