The turn model for adaptive routing
ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
A comprehensive analytical model for wormhole routing in multicomputer systems
Journal of Parallel and Distributed Computing
Planar-adaptive routing: low-cost adaptive networks for multiprocessors
Journal of the ACM (JACM)
A Cost and Speed Model for k-ary n-Cube Wormhole Routers
IEEE Transactions on Parallel and Distributed Systems
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
IEEE Transactions on Parallel and Distributed Systems
An Accurate Model for the Performance Analysis of Deterministic Wormhole Routing
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Analysis of k-ary n-cubes with dimension-ordered routing
Future Generation Computer Systems - Selected papers from CCGRID 2002
Performance Modeling of Fully Adaptive Wormhole Routing in 2-D Mesh-Connected Multiprocessors
MASCOTS '04 Proceedings of the The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Analytical performance modelling of partially adaptive routing in wormhole hypercubes
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Hi-index | 0.98 |
Although several analytical models have been proposed in the literature for different interconnection networks with different routing algorithms, there is only one work [M. Ould-Khaoua, An approximate performance model for partially adaptive routing algorithm in hypercubes, Microprocessors and Microsystems 23 (1999) 185-190] dealing with partially adaptive routing. It is not accurate enough especially in heavy traffic regions due to the rough approximation of assuming equal traffic rate over network channels. We show, however, such an approximation can greatly affect the accuracy of the model. This paper proposes an accurate analytical model to predict the average message latency in wormhole hypercube networks using partially adaptive routing. Our model accurately formulates the traffic rate over individual network channels and the results obtained from simulation experiments confirm that the proposed model exhibits a significant accuracy for various network sizes and under different operating conditions even in moderate to heavy traffic regions, the regions for which the model in [M. Ould-Khaoua, An approximate performance model for partially adaptive routing algorithm in hypercubes, Microprocessors and Microsystems 23 (1999) 185-190] fails to exhibit acceptable accuracy.