Loading...

Topological properties of stretched graphs

Shareghi, P ; Sharif University of Technology | 2006

270 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/aiccsa.2006.205158
  3. Publisher: IEEE Computer Society , 2006
  4. Abstract:
  5. We study a class of interconnection networks for multiprocessors, called the Stretched-G network, which is based on the base graph G by replacing each edge of the base network with an array of processors. Two interesting features of the proposed topology are its area-efficient VLSI layout and superior scalability over the underlying base network while preserving most of its desirable properties. We conduct a general study on the topological properties of stretched networks. We first obtain their basic topological parameters, after that we present an optimal routing algorithm. We also present a unified approach to obtain the topological properties and the VLSI-layout of an arbitrary stretched network based on the properties of the corresponding base network G. © 2006 IEEE
  6. Keywords:
  7. Algorithms ; Interconnection networks ; Multiprocessing systems ; VLSI circuits ; Optimal routing algorithms ; Scalability ; Graph theory
  8. Source: IEEE International Conference on Computer Systems and Applications, 2006, Sharjah, 8 March 2006 through 8 March 2006 ; Volume 2006 , 2006 , Pages 647-650 ; 1424402123 (ISBN); 9781424402120 (ISBN)
  9. URL: https://ieeexplore.ieee.org/document/1618423