CSE 291-a Interconnection Networks Lecture 7: February 7, 2007 Prof. Chung-Kuan Cheng CSE Dept, UC San Diego Winter 2007 Transcribed by Thomas Weng.

Slides:



Advertisements
Similar presentations
Chapter 11 Trees Graphs III (Trees, MSTs) Reading: Epp Chp 11.5, 11.6.
Advertisements

Switching - Fabric An Engineering Approach to Computer Networking.
Connectivity - Menger’s Theorem Graphs & Algorithms Lecture 3.
Single Source Shortest Paths
CS 140 Lecture 16 System Designs Professor CK Cheng CSE Dept. UC San Diego 1.
Lecture 4. Topics covered in last lecture Multistage Switching (Clos Network) Architecture of Clos Network Routing in Clos Network Blocking Rearranging.
Computer Engineering II
1 CS 140L Lecture 8 System Design Professor CK Cheng CSE Dept. UC San Diego.
FPGA Intra-cluster Routing Crossbar Design Dr. Philip Brisk Department of Computer Science and Engineering University of California, Riverside CS 223.
Walks, Paths and Circuits Walks, Paths and Circuits Sanjay Jain, Lecturer, School of Computing.
Bayesian Networks, Winter Yoav Haimovitch & Ariel Raviv 1.
Great Theoretical Ideas in Computer Science for Some.
1 Discrete Structures & Algorithms Graphs and Trees: III EECE 320.
Graphs III (Trees, MSTs) (Chp 11.5, 11.6)
1 Lecture 5 (part 2) Graphs II Euler and Hamiltonian Path / Circuit Reading: Epp Chp 11.2, 11.3.
1 Advancing Supercomputer Performance Through Interconnection Topology Synthesis Yi Zhu, Michael Taylor, Scott B. Baden and Chung-Kuan Cheng Department.
CS344 : Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 15, 16, 17- Completeness Proof; Self References and.
Heiko Schröder, 2003 Parallel Architectures 1 Various communication networks State of the art technology Important aspects of routing schemes Known results.
1 Discrete Structures & Algorithms Graphs and Trees: II EECE 320.
R. Bar-Yehuda © 1 קומבינטוריקה למדעי - המחשב – הרצאה #17 Chapter 2: TREES מבוסס על הספר : S. Even, "Graph Algorithms",
Switching Units.
What is the first line of the proof? a). Assume G has an Eulerian circuit. b). Assume every vertex has even degree. c). Let v be any vertex in G. d). Let.
Interconnection Networks Lecture 3: Topologies Jan. 17 th, 2007 Prof. Chung-Kuan Cheng Transcribed by: Mohammad Al-Fares.
CSE 291-a Interconnection Networks Lecture 12: Deadlock Avoidance (Cont’d) Router February 28, 2007 Prof. Chung-Kuan Cheng CSE Dept, UC San Diego Winter.
Switching Units.
Lecture 5#1#1 הודעה לשבוע הבא !  שבוע הבא אני לא נימצא  המתרגל ניר אנדלמן יעביר את השיעור  לא ילמד חומר חדש  נוכחות רשות !
Interconnection Networks Lecture 8: February 12, 2007 Prof. Chung-Kuan Cheng CSE Dept, UC San Diego Winter 2007 Transcribed by Wanping Zhang.
1 CSE 417: Algorithms and Computational Complexity Winter 2001 Lecture 19 Instructor: Paul Beame.
048866: Packet Switch Architectures Dr. Isaac Keslassy Electrical Engineering, Technion Scaling.
Is the following graph Hamiltonian- connected from vertex v? a). Yes b). No c). I have absolutely no idea v.
Interconnection Networks  Lecture 5 : January 29 th 2007 Prof. Chung-Kuan Cheng University of California San Diego Transcribed by: Jason Thurkettle.
CSE 291-a Interconnection Networks Lecture 15: Router (cont’d) March 5, 2007 Prof. Chung-Kuan Cheng CSE Dept, UC San Diego Winter 2007 Transcribed by Ling.
CSE 291 Interconnection Networks Winter 2007 Lecture 6 February Prof. Chung-Kuan Cheng University of California San Diego.
CSE 291-a Interconnection Networks Lecture 10: Flow Control February 21, 2007 Prof. Chung-Kuan Cheng CSE Dept, UC San Diego Winter 2007 Transcribed by.
Interconnection Networks  Lecture 6a : January 31 th 2007 Prof. Chung-Kuan Cheng University of California San Diego Transcribed by: Carmelo Kintana.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 5,Wednesday, September 10.
The Mathematics of Networks Chapter 7. Trees A tree is a graph that –Is connected –Has no circuits Tree.
CSE 140 Lecture 15 System Designs Professor CK Cheng CSE Dept. UC San Diego 1.
Minimum Spanning Trees. Subgraph A graph G is a subgraph of graph H if –The vertices of G are a subset of the vertices of H, and –The edges of G are a.
Interconnect Network Topologies
Introduction to Graph Theory
Interconnect Networks
First, let’s review the structure and use of a breadboard.
1 Dynamic Interconnection Networks Miodrag Bolic.
EE384y EE384Y: Packet Switch Architectures Part II Scaling Crossbar Switches Nick McKeown Professor of Electrical Engineering and Computer Science,
3.2 Matchings and Factors: Algorithms and Applications This copyrighted material is taken from Introduction to Graph Theory, 2 nd Ed., by Doug West; and.
Penn ESE534 Spring DeHon 1 ESE534: Computer Organization Day 18: April 2, 2014 Interconnect 4: Switching.
Lecture 4 Sorting Networks. Comparator comparator.
Circuit Switching Circuit switching networks,
Based on An Engineering Approach to Computer Networking/ Keshav
Homework - hints Problem 1. Node weights  Edge weights
EMIS 8374 Shortest Path Trees Updated 11 February 2008 Slide 1.
Introduction to Graph Theory
CSE 589 Applied Algorithms Spring 1999 Prim’s Algorithm for MST Load Balance Spanning Tree Hamiltonian Path.
Relations and Graphs Relations and Graphs Sanjay Jain, Lecturer, School of Computing.
EE384Y: Packet Switch Architectures Scaling Crossbar Switches
Aaron Bloomfield CS 202 Rosen, section 7.4
CSE 140 Lecture 14 System Designs
Lecture 2. Switching of physical circuits.
Great Theoretical Ideas in Computer Science
Packet Switching (basics)
Multiprocessors Interconnection Networks
CSE 140 Lecture 15 System Designs
Proof Techniques.
Discrete Mathematics for Computer Science
Graph Theory: Proof Techniques
Closures of Relations Epp, section 10.1,10.2 CS 202.
Circuit Switch Design Principles
CSE 140 Lecture 16 System Designs
Design Principles of Scalable Switching Networks
Presentation transcript:

CSE 291-a Interconnection Networks Lecture 7: February 7, 2007 Prof. Chung-Kuan Cheng CSE Dept, UC San Diego Winter 2007 Transcribed by Thomas Weng

Topics Circuit Switching - Definitions: Nonblocking, rearrangeable, strict. Crossbar Clos Networks

Crossbar n inputs, n outputs, n 2 switches Rearrangeable, strict and wide nonblocking If n is small, this is usually the best choice. xxx xxx xxx 1 2 n 12n

Engineering Issues 1.Physical layout (what to do with many nodes?) 2.Control (packet switching) Paper - BlackWidow: High-Radix Clos Networks, S. Scott, D. Abts, J. Kim, W.J. Dally 123n 1 2 n

Physical Layout (example) wires per row 64 horizontal wires 64 wires in between each signal 8x64 vertical wires in all 64 8x8 switches 1 8 8x8 crossbar Goes to row 1, row 2, …, row 8

Clos Network: Three Stage Clos(m,n,r) 1 n 2 n r n n x m 1 2 m r n n n

Clos Network (continued) 1.rn inputs, rn outputs 2.2rnm + mr 2 switches (this is less than r 2 n 2 ) Clos(m,n,r) is rearrangeable iff m >= n Let m = n 1.rn inputs 2rn 2 + nr 2 switches = (2n + r)rn (a crossbar is rn 2 switches) Optimal choice of n and r?

Clos Network - Proof Proof: By induction Clos(1,1,r) – you have r boxes, each box is 1 x 1 This is a crossbar, which we know is rearrangeable. 1 n 2 n r n.... r 1 2 r....

Clos Network – Proof (cont) Assume that for the case Clos(n-1, n-1, r), n>=2, the statement is true. For the case Clos(n, n, r), we use the first switch in the middle to reduce the requirement to Clos(n-1, n-1, r). 1 n r n n x m 1 n r n n

Clos Network – Proof (cont) Because n inputs, n outputs, we can always find a perfect matching. If we take out a middle box, and now have (n-1) inputs, (n-1) outputs n n n (r-1)n+1.. rxnrxn 11 22. nn PermutationOutput side (i,j) for (j) = i Each box will have n outputs Each box will have n input edges 1 n 2 n n n Each box is a node with degree=n 1 2 n n n n Bipartite graph Perfect matching

Clos Network – Strictly non- blocking 1 n 2 n r n n x (2n–1) 1 2 2n r n n n Clos Network is non-blocking in strict sense when m >= 2n-1. Each box has 2n-1 output pins Each box has 2n-1 input pins

Clos Network – Proof Proof by contradiction From i to j, we cannot make connection, e.g. from 1 to 2, we cannot make connection. Only time we can’t make a connection is if all paths are taken. Input i has taken n-1 signals, output j has taken n-1 signals. Thus, at most 2n-2 paths are taken. However, we have 2n-1 boxes for 2n-1 distinct paths between i and j. So we will always have at least one path to go through.

Clos Network – Proof (cont) 1 n 2 n r n n x (2n–1) 1 2 2n r n n n At most n-1 boxes taken from 1, and n-1 boxes taken from 2, so 2n-2 boxes are taken. n-1

Clos Network – More than three stages 1 n r n m r.... n n Clos Networks: Adding wires to reduce switches. Can we do better? Add even more wires to reduce number of switches? Yes! By increasing number of stages. Change middle stage box into another 3-stage Clos Network, this gives us 5-stage Clos Network. Can repeat this process! Replace with 3-stage Clos Network

Clos Network – More than three stages (cont) C(1) = N 2 switches (crossbar) C(3) = 6N 3/2 – 3N C(5) = 16N 4/3 – 14N + 3N 2/3 C(7) = 36N 5/4 – 46N + 20N 3/4 – 3N 1/2 C(9) = 76N 6/5 – 130N + 86N 4/5 – 26N 3/5 + 3N 2/5 (if N is huge, we want more levels)

Benes Network Start with Butterfly Network. What if we flip this, and repeat this network to the other side? This is Benes Network n n.... 2n 2x2 n inputs: (2n+1)2 n x4 switches N inputs: 2N(2log 2 N-1) switches