References
- Al Faisal, F. and Rahman, M. (2009). Symmetric tori connected torus network, Proceedings of the 12th International Conference on Computers and Information Technology (ICCIT), Dhaka, Bangladesh, pp. 174–179.
- Bossard, A. and Kaneko, K. (2012a). Node-to-set disjoint-path routing in hierarchical cubic networks, The Computer Journal55(12): 1440–1446.
- Bossard, A. and Kaneko, K. (2012b). The set-to-set disjoint-path problem in perfect hierarchical hypercubes, The Computer Journal55(6): 769–775.
- Bossard, A. and Kaneko, K. (2013). Set-to-set disjoint paths routing in hierarchical cubic networks, The Computer Journal57(2): 332–337.
- Bossard, A., Kaneko, K. and Peng, S. (2010). Node-to-set disjoint paths routing in metacube, Proceedings of the 22nd International Conference on Parallel and Distributed Computing and Systems (PDCS), Marina del Rey, CA, USA, pp. 289–296.
- Bossard, A., Kaneko, K. and Peng, S. (2011). A new node-to-set disjoint-path algorithm in perfect hierarchical hypercubes, The Computer Journal54(8): 1372–1381.
- Camara, J.M., Moreto, M., Vallejo, E., Beivide, R., Miguel-Alonso, J., Martinez, C. and Navaridas, J. (2010). Twisted torus topologies for enhanced interconnection networks, IEEE Transactions on Parallel and Distributed Systems21(12): 1765–1778.
- Duato, J., Yalamanchili, S. and Ni, L. (2003). Interconnection Networks: An Engineering Approach, Morgan Kaufmann, San Francisco, CA.
- Ghose, K. and Desai, K.R. (1995). Hierarchical cubic network, IEEE Transactions on Parallel and Distributed Systems6(4): 427–435.
- Horiguchi, S. and Ooki, T. (2000). Hierarchical 3d-torus interconnection network, Proceedings of the 5th International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN), Dallas, TX, USA, pp. 50–56.
- Lai, C.-N. (2012). Optimal construction of all shortest node-disjoint paths in hypercubes with applications, IEEE Transactions on Parallel and Distributed Systems23(6): 1129–1134.
- Li, Y., Peng, S. and Chu, W. (2004). Efficient collective communications in dual-cube, The Journal of Supercomputing28(1): 71–90.
- Li, Y., Peng, S. and Chu, W. (2010). Metacube—a versatile family of interconnection networks for extremely large-scale supercomputers, Journal of Supercomputing53(2): 329–351.
- Malluhi, Q.M. and Bayoumi, M.A. (1994). The hierarchical hypercube: A new interconnection topology for massively parallel systems, IEEE Transactions on Parallel and Distributed Systems5(1): 17–30.
- Preparata, F.P. and Vuillemin, J. (1981). The cube-connected cycles: A versatile network for parallel computation, Communications of the ACM24(5): 300–309.
- Seitz, C. (1985). The cosmic cube, Communications of the ACM28(1): 22–33.
- Shih, Y.-K., Chuang, H.-C., Kao, S.-S. and Tan, J.J. (2010). Mutually independent Hamiltonian cycles in dual-cubes, Journal of Supercomputing54(2): 239–251.
- Singh, A., Dally, W., Gupta, A. and Towles, B. (2003). Goal: A load-balanced adaptive routing algorithm for torus networks, SIGARCH Computer Architecture News31(2): 194–205.
- TOP500 (2013). China’s Tianhe-2 supercomputer takes no. 1 ranking on 41st TOP500 list, http://top500.org/blog/lists/2013/06/press-release/, (last accessed in August 2013).
- Wu, J. and Sun, X.-H. (1994). Optimal cube-connected cube multicomputers, Journal of Microcomputer Applications17(2): 135–146.
- Xiang, D. and Luo, W. (2012). An efficient adaptive deadlock-free routing algorithm for torus networks, IEEE Transactions on Parallel and Distributed Systems23(5): 800–808.
- Zhou, S., Chen, L. and Xu, J. (2012a). Conditional fault diagnosability of dual-cubes, International Journal of Foundations of Computer Science23(8): 1729–1748.
- Zhou, S., Lin, L. and Xu, J. (2012b). Conditional fault diagnosis of hierarchical hypercubes, International Journal of Computer Mathematics89(16): 2152–2164.