Static Networks


Published on

Published in: Education, Business, Technology
  • Be the first to comment

  • Be the first to like this

No Downloads
Total views
On SlideShare
From Embeds
Number of Embeds
Embeds 0
No embeds

No notes for slide

Static Networks

  1. 1. 1 Static Networks Dept. of Computer Science & Engineering 2013-2014 Presented By: Ranjit R. Banshpal Mtech 1st sem (CSE) Roll NO.18 1 A seminar on G.H. Raisoni College of Engineering Nagpur 1
  2. 2. Introduction • Static networks are directed links which are fixed once built • Linear Array • Ring and Chordal Ring • Barrel Shifter • Tree and Star • Fat Tree • Mesh and Torus
  3. 3. Static Networks–Mesh Pure mesh – N = n k nodes with links between each adjacent pair of nodes in a row or column (or higher degree). This is not a symmetric network; interior node degree d = 2k, diameter = k (n – 1). Illiac mesh (used in Illiac IV computer) – wraparound is allowed, thus reducing the network diameter to about half that of the equivalent pure mesh.
  4. 4. Static Networks –Torus • A torus has ring connections in each dimension, and is symmetric.  
  5. 5. Static Networks – Systolic Array • A systolic array is an arrangement of processing elements and communication links designed specifically to match the computation and communication requirements of a specific algorithm (or class of algorithms). • This specialized character may yield better performance than more generalized structures, but also makes them more expensive, and more difficult to program.
  6. 6. Static Networks – Hypercubes • A binary n-cube architecture with N = 2n nodes spanning along n dimensions, with two nodes per dimension. • The hypercube scalability is poor, and packaging is difficult for higher-dimensional hypercubes.
  7. 7. Static Networks – Cube-connected Cycles • k-cube connected cycles (CCC) can be created from a k-cube by replacing each vertex of the k-dimensional hypercube by a ring of k nodes. • A k-cube can be transformed to a k-CCC with k * 2k nodes.
  8. 8. Static Networks – k-ary n-Cubes • Rings, meshes, tori, binary n-cubes, and Omega networks (to be seen) are topologically isomorphic to a family of k-ary n-cube networks. • n is the dimension of the cube, and k is the radix, or number of of nodes in each dimension.   • The number of nodes in the network, N, is k n . • Folding (alternating nodes between connections) can be used to avoid the long “end-around” delays in the traditional implementation.
  9. 9. Static Networks – k-ary n-Cubes • The cost of k-ary n-cubes is dominated by the amount of wire, not the number of switches. • With constant wire bisection, low-dimensional networks with wider channels provide lower latecny, less contention, and higher “hot-spot” throughput than higher-dimensional networks with narrower channels.
  10. 10. THANK YOU