Loading...

Topological properties of necklace networks

Shareghi, P ; Sharif University of Technology | 2005

155 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/ISPAN.2005.86
  3. Publisher: 2005
  4. Abstract:
  5. We study a class of interconnection networks for multiprocessors, called the Necklace-G network that is based on the base graph G by attaching an array of processors to each two adjacent nodes of G. One of the interesting features of the proposed topology is its scalability while preserving most of the desirable properties of the underlying base network G. We conduct a general study on the topological properties of necklace networks. We first obtain their basic topological parameters, and then present optimal routing and broadcasting algorithms. We also present a unified approach to obtain the topological properties and the VLSI-layout of an arbitrary necklace network based on the properties of the corresponding base network G. © 2005 IEEE
  6. Keywords:
  7. Algorithms ; Integrated circuit layout ; Program processors ; Topology ; VLSI circuits ; Base networks ; Necklace-G network ; Topological parameters ; Interconnection networks
  8. Source: 8th International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN 2005, Las Vegas, NV, 7 December 2005 through 9 December 2005 ; Volume 2005 , 2005 , Pages 40-45 ; 0769525091 (ISBN); 9780769525099 (ISBN)
  9. URL: https://ieeexplore.ieee.org/document/1575803