Analysis of k-ary n-cubes with dimension-ordered routing

Authors:
H. Sarbazi-Azad;A. Khonsari;M. Ould-Khaoua
Affiliations:
Department of Computer Engineering, Sharif University of Technology, Tehran, Iran;Department of Computing Science, University of Glasgow, Glasgow, G12 8RZ Scotland, UK;Department of Computing Science, University of Glasgow, Glasgow, G12 8RZ Scotland, UK
Venue:
Future Generation Computer Systems - Selected papers from CCGRID 2002
Year:
2003

Citing 15
Cited 8

Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

IEEE Transactions on Computers
Multiprocessor performance

Multiprocessor performance
Performance Analysis of k-ary n-cube Interconnection Networks

IEEE Transactions on Computers
Performance of multicomputer networks under Pin-out constraints

Journal of Parallel and Distributed Computing
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
Performance evaluation of deterministic wormhole routing in k-ary n-cubes

Parallel Computing
Performance-Based Constraints for Multidimensional Networks

IEEE Transactions on Parallel and Distributed Systems
Performance of the CRAY T3E multiprocessor

SC '97 Proceedings of the 1997 ACM/IEEE conference on Supercomputing
Interconnection Networks: An Engineering Approach

Interconnection Networks: An Engineering Approach
Hypercube Communication Delay with Wormhole Routing

IEEE Transactions on Computers
Limits on Interconnection Network Performance

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

IEEE Transactions on Parallel and Distributed Systems
Performance Analysis of Mesh Interconnection Networks with Deterministic Routing

IEEE Transactions on Parallel and Distributed Systems
Theory, Volume 1, Queueing Systems

Theory, Volume 1, Queueing Systems

A performance model for analysis of heterogeneous multi-cluster systems

Parallel Computing
An accurate mathematical performance model of adaptive routing in the star graph

Future Generation Computer Systems
Combinatorial performance modelling of toroidal cubes

Journal of Systems Architecture: the EUROMICRO Journal
Performance analysis of deterministically-routed bi-directional torus with non-uniform traffic distribution

Future Generation Computer Systems
Analytical performance modelling of partially adaptive routing in wormhole hypercubes

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Performance analysis of interconnection networks for multi-cluster systems

ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
An accurate mathematical performance model of partially adaptive routing in binary n-cube multiprocessors

Mathematical and Computer Modelling: An International Journal
An accurate performance model for network-on-chip and multicomputer interconnection networks

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

K -ary n -cubes have been one of the most popular interconnection networks for practical multicomputers due to their ease of implementation and ability to exploit communication locality found in many parallel applications. This paper describes an analytical model for k -ary n -cubes with dimension-ordered routing. The main feature of the model is its ability to captures network performance when an arbitrary number of virtual channels are used to reduce message blocking. Simulation experiments reveal that the latency results predicted by the analytical model are in good agreement with those provided by the simulation model.