1 / 42

Weighted Random Oblivious Routing on Torus Networks

Weighted Random Oblivious Routing on Torus Networks. Rohit Sunkam Ramanujam Bill Lin Electrical and Computer Engineering University of California, San Diego. Networks-On-Chip. Chip-multiprocessors (CMPs) increasingly popular

elin
Télécharger la présentation

Weighted Random Oblivious Routing on Torus Networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Weighted Random Oblivious Routing on Torus Networks Rohit Sunkam Ramanujam Bill Lin Electrical and Computer Engineering University of California, San Diego

  2. Networks-On-Chip • Chip-multiprocessors (CMPs) increasingly popular • Torus, Mesh, Flattened Butterfly – candidate architectures for on-chip networks Intel Larrabee Tilera Tile64

  3. Networks-On-Chip • Chip-multiprocessors (CMPs) increasingly popular • Torus, Mesh, Flattened Butterfly – candidate architectures for on-chip networks Folded Torus 2D Torus

  4. Routing Algorithm Wishlist

  5. Outline • Motivation • Related Work • Optimal routing for rings • Optimal routing for 2D torus

  6. Optimal Oblivious Routing • Cast as a Multi-commodity flow problem • Maximize worst-case throughput • Minimize hop-count • Solve using Linear Programming • Impractical for large networks • Number of paths too large (exponential) • Hard to make it deadlock-free • LP not scalable

  7. Optimal Oblivious Routing

  8. Optimal 2TURN • Optimum oblivious routing with only 2TURN paths. 0,3 1,3 2,3 3,3 0,2 1,2 3,2 2,2 0,1 1,1 2,1 3,1 1,0 2,0 3,0 0,0

  9. Optimal 2TURN • Optimum oblivious routing with only 2TURN paths. 0,3 1,3 2,3 3,3 0,3 1,3 2,3 3,3 0,2 1,2 2,2 3,2 0,2 1,2 2,2 3,2 0,1 0,1 1,1 1,1 2,1 2,1 3,1 3,1 0,0 1,0 2,0 3,0 0,0 1,0 2,0 3,0

  10. Optimal 2TURN

  11. ValiantLoad Balancing(VAL) 2 phases of X-Y routing 0,3 1,3 2,3 3,3 0,2 1,2 2,2 3,2 0,1 1,1 2,1 3,1 0,0 1,0 2,0 3,0

  12. Improved Valiant Routing (IVAL) Phase1: X-Y, Phase2: Y-X 0,3 1,3 2,3 3,3 0,2 1,2 2,2 3,2 0,1 1,1 2,1 3,1 0,0 1,0 2,0 3,0

  13. Improved Valiant Routing (IVAL) Phase1: X-Y, Phase2: Y-X 0,3 1,3 2,3 3,3 0,2 1,2 2,2 3,2 0,1 1,1 2,1 3,1 0,0 1,0 2,0 3,0

  14. VAL and IVAL

  15. Latency Comparison 13.5%

  16. Evolution of W2TURN Step 1. Started with the simple case of 1D rings • Developed Weighted Random Direction (WRD) Step 2. Described 2TURN paths in IVAL in terms of routing on 1D segments (I2TURN) • I2TURN has analytical expression for hop count. Step 3.Combined the intuition gained from WRD, I2TURN and optimal 2TURN • Developed Weighted random 2TURN routing (W2TURN) • Analytically showed latency of W2TURN strictly better than I2TURN

  17. Outline • Motivation • Related Work • Optimal routing for rings • Optimal routing for 2D torus

  18. Routing on Rings • Randomized Load Balancing (RLB) – Optimal worst-case throughput for rings • Same routing strategy for both odd and even radix networks

  19. Some Facts … • Worst-case throughput determined by maximum channel load under most adversarial traffic • For a torus network with radix k, • Maximum channel for worst-case throughput optimality = k/4 Even k = k/4 – 1/4k Odd k

  20. Rings – The Difference Between Oddand Even • RLB: Route minimally with probability (k-∆)/k • Why can’t we route minimally more often? Tornado traffic ∆ = (k-1)/2 Total Channel load = (k-1)/2 * (k+1)/2k = k/4 - 1/4k = Maximum load for worst-case throughput optimality

  21. Rings – The Difference Between Odd and Even • RLB: Route minimally with probability (k-∆)/k. • Can we route minimally more often? Route minimally with a probability of (k-∆-1)/(k-2) > (k-∆)/k Tornado traffic ∆ = k/2-1 Total Channel load = (k/2 – 1) * (k+2)/2k = k/4 – 1/k < Maximum load for worst-case throughput optimality

  22. WRD Algorithm • Odd radix: • Route minimally with probability (k-∆)/k • Route non-minimally with probability ∆/k • Even radix: • Route minimally with probability (k-∆-1)/(k-2) when k > 2 and ∆ > 0 • Route non-minimally with probability (∆-1)/(k-2) when k > 2 and ∆ > 0

  23. Latency Evaluation 25%

  24. WRD=Optimal

  25. WRD - Ideal for 1D Rings

  26. Outline • Motivation • Related Work • Optimal routing for rings • Optimal routing for 2D torus

  27. I2TURN • Describe 2TURN paths in terms of 1D segments. • 2TURN paths: X-Y-X or Y-X-Y • X-Y-X routing • Select intermediate X position x* at uniform random • Route minimally to x* • Route using RLB on the Y ring at X=x* 0,3 1,3 2,3 3,3 0,2 1,2 2,2 3,2 0,1 1,1 2,1 3,1 1,0 0,0 2,0 3,0

  28. I2TURN • Describe 2TURN paths in terms of 1D segments. • 2TURN paths: X-Y-X or Y-X-Y • X-Y-X routing • Select intermediate X position x* at uniform random • Route minimally to x* • Route using RLB on the Y ring at X=x* 0,3 1,3 2,3 3,3 0,2 1,2 2,2 3,2 1/4 0,1 1,1 2,1 3,1 0,0 1,0 2,0 3,0

  29. I2TURN • Describe 2TURN paths in terms of 1D segments. • 2TURN paths: X-Y-X or Y-X-Y • X-Y-X routing • Select intermediate X position x* at uniform random • Route minimally to x* • Route using RLB on the Y ring at X=x* • Route minimally to the destination 0,3 1,3 2,3 3,3 0,2 1,2 2,2 3,2 3/4 1/4 0,1 1,1 2,1 3,1 0,0 1,0 2,0 3,0

  30. I2TURN – Main Idea • For XYX routing, load balance across the Y-rings to make traffic along every Y-ring admissible • Use worst-case throughput optimal routing (RLB) on the Y-ring • Can easily derive analytical expression for average packet latency • Can be proved to be equivalent to IVAL. Hence, it is worst-case throughput optimal • Can define YXY routing by swapping dimensions

  31. W2TURN – Even Radix • Reduces latency over I2TURN • Use WRD instead of RLB • Interpolate X-Y-X and Y-X-Y 2TURN routing with minimal X-Y and Y-X routing • XYX : k/2(k+1) • YXY : k/2(k+1) • XY: 1/2(k+1) • YX: 1/2(k+1)

  32. X-Y-X W2TURN • X-Y-X routing • Select intermediate X position x* at uniform random • Route minimally to x* • Route using WRD on the Y ring at X=x* 0,3 1,3 2,3 3,3 0,2 1,2 2,2 3,2 0,1 1,1 2,1 3,1 1,0 0,0 2,0 3,0

  33. X-Y-X W2TURN • X-Y-X routing • Select intermediate X position x* at uniform random • Route minimally to x* • Route using WRD on the Y ring at X=x* 0,3 1,3 2,3 3,3 0,2 1,2 2,2 3,2 1 0,1 1,1 2,1 3,1 1,0 0,0 2,0 3,0

  34. X-Y-X W2TURN • X-Y-X routing • Select intermediate X position x* at uniform random • Route minimally to x* • Route using WRD on the Y ring at X=x* • Route minimally to the destination 0,3 1,3 2,3 3,3 0,2 1,2 2,2 3,2 1 0,1 1,1 2,1 3,1 1,0 0,0 2,0 3,0 When number of hops in both directions are equal, avoid using links used by minimal X-Y or Y-X routing.

  35. W2TURN – Odd Radix • W2TURN = Optimal 2TURN for odd radix • More elaborate description but easy to implement • Uses X-Y-X and Y-X-Y 2TURN routing with equal probability • Most of the intuition gained by observing optimal 2TURN paths

  36. Latency Evaluation 13.5%

  37. W2TURN ≈ Optimal-2TURN W2TURN = Optimal-2TURN for odd radix W2TURN within 0.72% of Optimal-2TURN for even radix

  38. Back to our Wishlist …

  39. Summary of Contributions • WRD: Optimal routing algorithm for rings • Worst-case throughput optimal • Minimum hop count • W2TURN-Odd: Optimal 2TURN routing with a closed form description for 2D torus with odd radix • W2TURN-Even: Latency within 0.072% of optimal 2TURN routing for 2D torus with even radix • WRD and W2TURN are best performing closed-form algorithms for 1D and 2D torus!!

  40. Thank You !!

  41. Average case throughput

  42. Proof of worst-case throughput optimality • Optimal worst-case channel load = 2*(Channel load for uniform traffic) • To prove a routing is worst-case throughput optimal, sufficient to prove that maximum channel load: = k/4 when k is even. = k/4 – 1/4k when k is odd.

More Related