The hierarchical cliques interconnection network-Reference-Cited by-同舟云学术

The hierarchical cliques interconnection network

Published:2004-01 Issue:1 Volume:64 Page:16-28
ISSN:0743-7315
Container-title:Journal of Parallel and Distributed Computing
language:en
Short-container-title:Journal of Parallel and Distributed Computing

Author:

Campbell Stuart,Kumar Mohan,Olariu Stephan

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference16 articles.

1. Limits on interconnection network performance;Agarwal;IEEE Trans. Parallel Distrib. Systems,1991

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. The Combinatorics of Network Reliability;Colbourn,1987

4. Deadlock-free message routing in multiprocessor interconnection networks;Dally;IEEE Trans. Comput.,1987

5. Properties and performance of folded hypercubes;El-Amawy;IEEE Trans. Parallel Distrib. Systems,1991

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A class of hierarchical graphs as topologies for interconnection networks;Theoretical Computer Science;2010-06

2. The Distributed Spanning Tree Structure;IEEE Transactions on Parallel and Distributed Systems;2009-12

3. MidFusion: An adaptive middleware for information fusion in sensor network applications;Information Fusion;2008-07

4. Binomial Graph: A Scalable and Fault-Tolerant Logical Network Topology;Parallel and Distributed Processing and Applications;2007

5. Self-healing in Binomial Graph Networks;On the Move to Meaningful Internet Systems 2007: OTM 2007 Workshops