A simple mathematical model of adaptive routing in wormhole k-ary n-cubes

Authors:
H. Sarbazi-Azad;M. Ould-Khaoua
Affiliations:
Glasgow University, Glasgow, UK;Glasgow University, Glasgow, UK
Venue:
Proceedings of the 2002 ACM symposium on Applied computing
Year:
2002

Citing 15
Cited 2

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
System design of the J-Machine

AUSCRYPT '90 Proceedings of the sixth MIT conference on Advanced research in VLSI
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
Performance evaluation of deterministic wormhole routing in k-ary n-cubes

Parallel Computing
A Performance Model for Duato's Fully Adaptive Routing Algorithm in k$k$-Ary n$n$-Cubes

IEEE Transactions on Computers
Performance-Based Constraints for Multidimensional Networks

IEEE Transactions on Parallel and Distributed Systems
An accurate analytical model of adaptive wormhole routing in k-ary n-cubes interconnection networks

Performance Evaluation
Interconnection Networks: An Engineering Approach

Interconnection Networks: An Engineering Approach
iWarp: A 100-MOPS, LIW Microprocessor for Multicomputers

IEEE Micro
Limits on Interconnection Network Performance

IEEE Transactions on Parallel and Distributed Systems
Virtual-Channel Flow Control

IEEE Transactions on Parallel and Distributed Systems
The Reliable Router: A Reliable and High-Performance Communication Substrate for Parallel Computers

PCRCW '94 Proceedings of the First International Workshop on Parallel Computer Routing and Communication
Theory, Volume 1, Queueing Systems

Theory, Volume 1, Queueing Systems

Off-chip communication architectures for high throughput network processors

Computer Communications
Analytical performance modeling of shuffle-exchange inspired mesh-based Network-on-Chips

Performance Evaluation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many fully-adaptive algorithms have been proposed for k-ary n-cubes over the past decade. The performance characteristics of most of these algorithms have been analysed by means of software simulation only. This paper proposes a simple yet reasonably accurate analytical model to predict message latency in wormhole-routed k-ary n-cubes with fully adaptive routing. This model requires a running time of O(1) which is the fastest model yet reported in the literature while maintaining reasonable accuracy.