Performance comparison of adaptive routing algorithms in the star interconnection network

摘要: The star graph was introduced as an attractive alternative to the well-known hypercube and its properties have been well studied in past. Most of these studies focused on topological algorithmic aspects this network. In paper, performance nine fully-adaptive routing algorithms network is under uniform (with without locality) hotspot traffic patterns. factors considered are average message latency utilization. We consider three basic (two hop scheme algorithms: positive-hop negative-hop, Misic's algorithm) two other improved sets based algorithms. result applying simple modifications Simulation results show that for a low hot-spot portion) patterns, first set yields better compared second outperforms (the algorithms) different working conditions