The Stretched Network: Properties, Routing, and Performance

No abstract is available for this paper.

• Publication year

  2008

• Venue

  Journal of information science and engineering

• Publication date

  Unknown publication date

• Fields of study

  Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Topological Properties of Stretched Graphs

  2006cited by this paper
• The stretched-hypercube: a VLSI efficient network topology

  2005cited by this paper
• The necklace-hypercube: a well scalable hypercube-based interconnection network for multiprocessors

  2005cited by this paper
• Topological properties of necklace networks

  2005cited by this paper
• Some Properties of Swapped Interconnection Networks

  2004cited by this paper
• On The Combinatorial Properties Of k-Ary n-Cubes

  2004cited by this paper
• Incomplete k-ary n-cube and its derivatives

  2004cited by this paper
• On some combinatorial properties of meshes

  2004cited by this paper
• Hyper-Star Graph: A New Interconnection Network Improving the Network Cost of the Hypercube

  2002cited by this paper
• Interconnection Networks: An Engineering Approach

  2002cited by this paper
• A survey of graph layout problems

  2002cited by this paper
• Topological Properties of OTIS-Networks

  2002cited by this paper
• Area-Efficient VLSI Layouts for Binary Hypercubes

  2000cited by this paper
• The Hyperstar Interconnection Network

  1998cited by this paper
• Product-closed networks

  1998cited by this paper
• Honeycomb Networks: Topological Properties and Communication Algorithms

  1997cited by this paper
• The Star Graph: An Attractive Alternative to the n-Cube

  1994cited by this paper
• Folded Petersen cube networks: new competitors for the hypercubes

  1993cited by this paper
• dBCube: A New Class of Hierarchical Multiprocessor Interconnection Networks with Area Efficient Layout

  1993cited by this paper
• Graph Problems Related to Gate Matrix Layout and PLA Folding

  1990cited by this paper
• Topological properties of hypercubes

  1988cited by this paper
• Performance Analysis of k-Ary n-Cube Interconnection Networks

  1987cited by this paper
• The cube-connected-cycles: A versatile network for parallel computation

  1979cited by this paper

• Power-efficient deterministic and adaptive routing in torus networks-on-chip

  2012cites this paper
• The triangular pyramid: Routing and topological properties

  2010cites this paper
• Adaptive routing in wormhole-switched necklace-cubes: Analytical modelling and performance comparison

  2009cites this paper
• for Interconnection Networks and a Novel Scalable

  year unknowncites this paper