loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05)
The Stretched-Hypercube: A VLSI Efficient Network Topology
Las Vegas, Nevada, USA
December 07-December 09
ISBN: 0-7695-2509-1
Pooya Shareghi, Sharif University of Technology and IPM School of Computer Science Tehran, Iran
Hamid Sarbazi-Azad, Sharif University of Technology and IPM School of Computer Science Tehran, Iran
In this paper, we introduce a new class of interconnection networks for multiprocessor systems which we refer to as Stretched-Hypercubes, or shortly the Stretched-Cube networks. These networks are obtained by replacing an edge of the well-known hypercube network with an array of processors. Two interesting features of the proposed topology are its area-efficient VLSI layout and superior scalability over the traditional hypercube network. Some topological properties of the proposed network are studied. In addition, an area-efficient VLSI layout for the stretched-cube is suggested and some comparisons between the proposed network and previously studied networks such as the star and hypercube are conducted.
Citation:
Pooya Shareghi, Hamid Sarbazi-Azad, "The Stretched-Hypercube: A VLSI Efficient Network Topology," ispan, pp.462-467, 8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.