Embedding meshes on the star graph
Journal of Parallel and Distributed Computing
A Framework for Designing Deadlock-Free Wormhole Routing Algorithms
IEEE Transactions on Parallel and Distributed Systems
Optimal Parallel Routing in Star Networks
IEEE Transactions on Computers
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
A parallel algorithm for Lagrange interpolation on the star graph
Journal of Parallel and Distributed Computing
A Parallel Algorithm for Computing Fourier Transforms on the Star Graph
IEEE Transactions on Parallel and Distributed Systems
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
A comparative performance analysis of n-cubes and star graphs
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Analytical performance modelling of adaptive wormhole routing in the star interconnection network
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-know 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. In this paper, the performance of nine fully-adaptive routing algorithm in the star network are studied under uniform (with and without locality) and hotspot traffic patterns. The performance fictors considered are the average message latency and network utilizationn. We consider three basic routing algorithms (two hop scheme routing algorithm: positive-hop and negative-hop, and Msick routing algorithm) and two other improved sets of improved algorithm based on the basic algorithm, The improved algorithm are the result of applyng simple modifications to the basic algorithm. Simulation results show that for uniform (with and without locality) and hotspot traffic (with a low hotspot portion) patterns, the first set of improved routing algorithm yields a better performance compared to the basic algorithm. The second set of improved routing algorithm outperform the other two sets (the basic set and the first set of improved algorithm) under different working conditions.