Incomplete k-ary n-cube and its derivatives

Journal of Parallel and Distributed Computing

Volumn 64, Issue 2, 2004, Pages 183-190

  Parhami, Behrooz ^a   Kwai, Ding Ming ^a  

^a University of California   (United States)

Author keywords

Cayley graph; Fault diameter; Fault tolerance; Fixed degree network; Interconnection network; k Ary n cube; Pruning; Routing algorithm; VLSI layout

Indexed keywords

ALGORITHMS; BANDWIDTH; COMPUTER SCIENCE; ELECTRICAL ENGINEERING; FAULT TOLERANT COMPUTER SYSTEMS; GRAPH THEORY; INTERCONNECTION NETWORKS; MATRIX ALGEBRA; THEOREM PROVING; VLSI CIRCUITS;

CAYLEY GRAPHS; FAULT DIAMETERS; FIXED-DEGREE NETWORKS; K-ARY N-CUBE; PRUNING; ROUTING ALGORITHMS; VLSI LAYOUT;

PARALLEL PROCESSING SYSTEMS;

EID: 2942594159     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2003.11.009     Document Type: Article

References (17)

1. Akers S.B., Krishnamurthy B. A group-theoretic model for symmetric interconnection networks. IEEE Trans. Comput. 38(4):April 1989;555-566.
2. R. Alverson, D. Callahan, D. Cummings, B. Koblenz, A. Porterfield, B. Smith, The tera computer system, Proceedings of the ACM International Conference on Supercomputing, Amsterdam, June 1990, pp. 1-6.
3. Bilardi G., Preparata F.P. Horizons of parallel computation. J. Parallel Distrib. Comput. 27:June 1995;172-182.
4. Bose B., Broeg B., Kwon Y., Ashir Y. Lee distance and topological properties of. k -ary n -cubes IEEE Trans. Comput. 44:August 1995;1021-1030.
5. Carlson G.E., Cruthirds J., Section H., Wright C. Interconnection networks based on generalization of cube-connected cycles. IEEE Trans. Comput. 34:August 1985;769-772.
6. Dally W.J. Performance analysis of. k -ary n -cube interconnection networks IEEE Trans. Comput. 39(6):June 1990;775-785.
7. Gu Q.-P., Peng S. Fault tolerant routing in Toroidal networks. IEICE Trans. Inform. Systems. E79-D:August 1996;1153-1159.
8. Hsu W.-J., Chung M.J., Hu Z. Gaussian networks for scalable distributed systems. Computer J. 39(5):1996;417-426.
9. W.W. Kirkman, D. Quammen, Packed exponential connections - a hierarchy of 2-D meshes, Proceedings of the International Parallel Processing Symposium, April 1994, pp. 464-470.
10. Krishnamoorthy M.S., Krishnamurthy B. Fault diameter of interconnection networks. Comput. Math. Appl. 13(5/6):1987;577-582.
11. D.-M. Kwai, B. Parhami, Comparing torus, pruned torus, and Manhattan Street networks as interconnection architectures for highly parallel computers, Proceedings of the International Conference on Parallel and Distributed Computing and Systems, Cambridge, MA, November 1999, pp. 19-22.
12. Lakshmivarahan S., Jwo J.-S., Dahl S.K. Symmetry in interconnection networks based on Cayley graphs of permutation group. a survey Parallel Comput. 19:1993;361-401.
13. J. Nguyen, J. Pezaris, G. Pratt, S. Ward, Three-dimensional network topologies, Proceedings of the International Workshop Parallel Computer Routing and Communication, Seattle, May 1994, pp. 101-115.
14. Parhami B. Introduction to Parallel Processing: Algorithms and Architectures. 1999;Plenum Press, New York.
15. Parhami B., Kwai D.-M. Periodically regular chordal rings. IEEE Trans. Parallel Distrib. Systems. 10(6):June 1999;658-672.
16. Preparata F.P., Vuillemin J. The cube-connected cycles. a versatile network for parallel computation Comm. ACM. 24(5):May 1981;300-309.
17. A. Youssef, Design and analysis of product networks, Proceedings of the Symposium Frontiers of Massively Parallel Computation, February 1995, pp. 521-528.