Performance of the Direct Binary n-Cube Network for Multiprocessors
IEEE Transactions on Computers
A comparison of adaptive wormhole routing algorithms
ISCA '93 Proceedings of the 20th annual international symposium on computer architecture
Routing function and deadlock avoidance in a star graph interconnection network
Journal of Parallel and Distributed Computing
A comprehensive analytical model for wormhole routing in multicomputer systems
Journal of Parallel and Distributed Computing
A Framework for Designing Deadlock-Free Wormhole Routing Algorithms
IEEE Transactions on Parallel and Distributed Systems
Hypercube Communication Delay with Wormhole Routing
IEEE Transactions on Computers
Limits on Interconnection Network Performance
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
A Comparative Study of Topological Properties of Hypercubes and Star Graphs
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
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
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Performance Comparison of Adaptive Routing Algorithms in the Star Network
HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
An accurate mathematical performance model of adaptive routing in the star graph
Future Generation Computer Systems
Analytic performance comparison of hypercubes and star graphs with implementation constraints
Journal of Computer and System Sciences
Performance modeling of Cartesian product networks
Journal of Parallel and Distributed Computing
A comparative performance analysis of n-cubes and star graphs
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Hi-index | 0.00 |
The star graph was introduced as an attractive alternative to the well-known hypercube and its properties have been well studied in the past. Most of these studies have focused on topological properties and algorithmic aspects of this network. Although several analytical models have been proposed in the literature for different interconnection networks, none of them have dealt with star graphs. This paper proposes the first analytical model to predict message latency in wormhole-switched star interconnection networks with fully adaptive routing. The analysis focuses on a fully adaptive routing algorithm which has shown to be the most effective for star graphs. The results obtained from simulation experiments confirm that the proposed model exhibits a good accuracy under different operating conditions.