摘要: Stretched hypercube has recently been introduced as an attractive alternative to the well-known hypercube. Previous research on this network topology mainly focused topological properties and VLSI aspects of network. In paper, we propose some deterministic adaptive routing algorithms for stretched hypercubes. The performance hypercubes using proposed is then evaluated by means simulation experiments. Experiments are realized under different working loads factors.
sci-hub.se 参考文章(4)
J. Duato, A new theory of deadlock-free adaptive routing in wormhole networks IEEE Transactions on Parallel and Distributed Systems. ,vol. 4, pp. 1320- 1331 ,(1993) , 10.1109/71.250114
A. Patel, A. Kusalik, C. McCrosky, Area-efficient VLSI layouts for binary hypercubes IEEE Transactions on Computers. ,vol. 49, pp. 160- 169 ,(2000) , 10.1109/12.833112
P. Shareghi, H. Sarbazi-Azad, Topological Properties of Stretched Graphs IEEE International Conference on Computer Systems and Applications, 2006.. pp. 647- 650 ,(2006) , 10.1109/AICCSA.2006.205158
K. Day, A. Tripathi, A comparative study of topological properties of hypercubes and star graphs IEEE Transactions on Parallel and Distributed Systems. ,vol. 5, pp. 31- 38 ,(1994) , 10.1109/71.262586