The hierarchical cliques interconnection network

Journal of Parallel and Distributed Computing

Volumn 64, Issue 1, 2004, Pages 16-28

  Campbell, Stuart ^a,b   Kumar, Mohan ^b   Olariu, Stephan ^c  

^a FAIR ISAAC CORPORATION   (United States)

^b University of Texas at Arlington   (United States)

^c Old Dominion University   (United States)

Author keywords

Cliques; Fault tolerance; Interconnection networks; Network embedding; Trees

Indexed keywords

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

References (16)

1. A. Agarwal, Limits on interconnection network performance, IEEE Trans. Parallel Distrib. Systems 2 (4) (1991) 398-412.
2. S.M. Campbell, M.J. Kumar, Hierarchical cliques: cost effective multiprocessor interconnection network, IASTED International Conference on Parallel and Distributed Computing and Systems October 16-19, Chicago, Illinois, USA, IASTED, 1996, pp. 134-138.
3. C.J. Colbourn, The Combinatorics of Network Reliability, Oxford University Press, New York, 1987.
4. W.J. Dally, C.L. Seitz, Deadlock-free message routing in multi-processor interconnection networks, IEEE Trans. Comput. C-36 (5) (1987) 547-553.
5. A. El-Amawy, S. Latifi, Properties and performance of folded hypercubes, IEEE Trans. Parallel Distrib. Systems 2 (1) (1991) 31-42.
6. A-H. Esfahanian, Generalized measures of fault tolerance with application to n-cube networks, IEEE Trans. Comput. 38 (11) (1989) 1586-1591.
7. M.S. Krishnamoorthy, B. Krishnamurthy, Fault diameter of interconnection networks, Comput. Math. Appl. 13 (5/6) (1987) 577-582.
8. J.M. Kumar, L.M. Patnaik, Extended hypercube: a hierarchical interconnection network of hypercubes, IEEE Trans. Parallel Distrib. Systems 3 (1) (1992) 45-57.
9. C.E. Leiserson, Fat-trees: universal networks for hardware-efficient supercomputing, IEEE Trans. Comput. C-34 (10) (1985) 892-900.
10. Q.M. Malluhi, M.A. Bayoumi, The hierarchical hypercube: a new interconnection topology for massively parallel systems, IEEE Trans. Parallel Distrib. Systems 5 (1) (1994) 17-30.
11. B. Monien, H. Sudborough, Embedding one interconnection network in another, in: G. Tinhofer, E. Mayr, H. Noltemeier, M. Syslo (Eds.), Computational Graph Theory, Springer, Berlin, 1990.
12. S.R. Öhring, S.K. Das, Folded Petersen cube networks: new competitors for the hypercube, The International Parallel Processing Symposium, Anaheim, CA, USA, April 1993.
13. S.R. Öhering, M. Ibel, S.K. Das, M.J. Kumar, On generalized fat trees, International Parallel Processing Symposium, Santa Barbara, CA, April 1995, pp. 37-45.
14. Y. Saad, M.H. Schultz, Topological properties of hypercubes, IEEE Trans. Comput. 37 (7) (1988) 867-872.
15. S-B. Tien, C.S. Raghavendra, Algorithms and bounds for shortest paths and diameter in faulty hypercubes, IEEE Trans. Parallel Distrib. Systems 4 (6) (1993) 713-718.
16. N-F. Tzeng, S. Wei, Enhanced hypercubes, IEEE Trans. Comput. 40 (3) (1991) 284-293.