ECE669 L16: Interconnection Topology March 30, 2004 ECE 669 Parallel Computer Architecture Lecture 16 Interconnection Topology.

Slides:

Advertisements

Similar presentations

Comparison Of Network On Chip Topologies Ahmet Salih BÜYÜKKAYHAN Fall.

Advertisements

Parallel Architectures: Topologies Heiko Schröder, 2003.

Parallel Architectures: Topologies Heiko Schröder, 2003.

1 Interconnection Networks Direct Indirect Shared Memory Distributed Memory (Message passing)

CSCI 8150 Advanced Computer Architecture Hwang, Chapter 2 Program and Network Properties 2.4 System Interconnect Architectures.

1 Lecture 23: Interconnection Networks Topics: communication latency, centralized and decentralized switches (Appendix E)

CS252 Graduate Computer Architecture Lecture 14 Multiprocessor Networks March 10 th, 2010 John Kubiatowicz Electrical Engineering and Computer Sciences.

ECE669 L12: Interconnection Network Performance March 9, 2004 ECE 669 Parallel Computer Architecture Lecture 12 Interconnection Network Performance.

EECC756 - Shaaban #1 lec # 9 Spring Network Definitions A network is a graph V = {switches and nodes} connected by communication channels.

Parallel Routing Bruce, Chiu-Wing Sham. Overview Background Routing in parallel computers Routing in hypercube network –Bit-fixing routing algorithm –Randomized.

CS 258 Parallel Computer Architecture Lecture 4 Network Topology and Routing February 4, 2008 Prof John D. Kubiatowicz

CS 258 Parallel Computer Architecture Lecture 5 Routing February 6, 2008 Prof John D. Kubiatowicz

Generic Multiprocessor Architecture

CS252 Graduate Computer Architecture Lecture 15 Multiprocessor Networks (con’t) March 15 th, 2010 John Kubiatowicz Electrical Engineering and Computer.

ECE669 L25: Final Exam Review May 6, 2004 ECE 669 Parallel Computer Architecture Lecture 25 Final Exam Review.

1 Lecture 24: Interconnection Networks Topics: communication latency, centralized and decentralized switches (Sections 8.1 – 8.5)

Interconnection Network Topologies

CS 258 Parallel Computer Architecture Lecture 3 Introduction to Scalable Interconnection Network Design January 30, 2008 Prof John D. Kubiatowicz

3. Interconnection Networks. Historical Perspective Early machines were: Collection of microprocessors. Communication was performed using bi-directional.

EECS 570: Fall rev1 1 Chapter 10: Scalable Interconnection Networks.

EECC756 - Shaaban #1 lec # 9 Spring Generic Multiprocessor Architecture Generic Multiprocessor Architecture Node: processor(s), memory system,

Interconnection Network Topology Design Trade-offs

1 Lecture 25: Interconnection Networks Topics: communication latency, centralized and decentralized switches, routing, deadlocks (Appendix E) Review session,

CS252/Patterson Lec /28/01 CS162 Computer Architecture Lecture 16: Multiprocessor 2: Directory Protocol, Interconnection Networks.

1 Static Interconnection Networks CEG 4131 Computer Architecture III Miodrag Bolic.

EECC756 - Shaaban #1 lec # 10 Spring Generic Multiprocessor Architecture Generic Multiprocessor Architecture Node: processor(s), memory system,

CS252 Graduate Computer Architecture Lecture 14 Multiprocessor Networks March 9 th, 2011 John Kubiatowicz Electrical Engineering and Computer Sciences.

John Kubiatowicz Electrical Engineering and Computer Sciences

© Sudhakar Yalamanchili, Georgia Institute of Technology (except as indicated) Topologies.

Interconnect Network Topologies

CS252 Graduate Computer Architecture Lecture 15 Multiprocessor Networks March 14 th, 2011 John Kubiatowicz Electrical Engineering and Computer Sciences.

CS252 Graduate Computer Architecture Lecture 15 Multiprocessor Networks March 12 th, 2012 John Kubiatowicz Electrical Engineering and Computer Sciences.

Interconnection Networks. Applications of Interconnection Nets Interconnection networks are used everywhere! ◦ Supercomputers – connecting the processors.

Interconnect Networks

Network Topologies Topology – how nodes are connected – where there is a wire between 2 nodes. Routing – the path a message takes to get from one node.

CS668- Lecture 2 - Sept. 30 Today’s topics Parallel Architectures (Chapter 2) Memory Hierarchy Busses and Switched Networks Interconnection Network Topologies.

CSE Advanced Computer Architecture Week-11 April 1, 2004 engr.smu.edu/~rewini/8383.

1 Scalable Interconnection Networks. 2 Scalable, High Performance Network At Core of Parallel Computer Architecture Requirements and trade-offs at many.

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Parallel Programming in C with MPI and OpenMP Michael J. Quinn.

Course Wrap-Up Miodrag Bolic CEG4136. What was covered Interconnection network topologies and performance Shared-memory architectures Message passing.

Multiprocessor Interconnection Networks Todd C. Mowry CS 740 November 3, 2000 Topics Network design issues Network Topology.

Lecture 3 Innerconnection Networks for Parallel Computers

ECE669 L21: Routing April 15, 2004 ECE 669 Parallel Computer Architecture Lecture 21 Routing.

Anshul Kumar, CSE IITD CSL718 : Multiprocessors Interconnection Mechanisms Performance Models 20 th April, 2006.

Computer Science and Engineering Parallel and Distributed Processing CSE 8380 January Session 4.

InterConnection Network Topologies to Minimize graph diameter: Low Diameter Regular graphs and Physical Wire Length Constrained networks Nilesh Choudhury.

Anshul Kumar, CSE IITD ECE729 : Advanced Computer Architecture Lecture 27, 28: Interconnection Mechanisms In Multiprocessors 29 th, 31 st March, 2010.

Birds Eye View of Interconnection Networks

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Shared versus Switched Media.

1 Interconnection Networks. 2 Interconnection Networks Interconnection Network (for SIMD/MIMD) can be used for internal connections among: Processors,

Interconnect Networks Basics. Generic parallel/distributed system architecture On-chip interconnects (manycore processor) Off-chip interconnects (clusters.

Super computers Parallel Processing

Topology How the components are connected. Properties Diameter Nodal degree Bisection bandwidth A good topology: small diameter, small nodal degree, large.

Spring EE 437 Lillevik 437s06-l22 University of Portland School of Engineering Advanced Computer Architecture Lecture 22 Distributed computer Interconnection.

COMP8330/7330/7336 Advanced Parallel and Distributed Computing Tree-Based Networks Cache Coherence Dr. Xiao Qin Auburn University

Interconnection Networks Communications Among Processors.

Interconnect Networks

Lecture 23: Interconnection Networks

Multiprocessor Interconnection Networks Todd C

Interconnection topologies

Prof John D. Kubiatowicz

Static and Dynamic Networks

Interconnection Network Routing, Topology Design Trade-offs

John Kubiatowicz Electrical Engineering and Computer Sciences

Interconnection Network Design Lecture 14

Static Interconnection Networks

Advanced Computer Architecture 5MD00 / 5Z032 Multi-Processing 2

Interconnection Networks Contd.

Birds Eye View of Interconnection Networks

Static Interconnection Networks

Presentation transcript:

ECE669 L16: Interconnection Topology March 30, 2004 ECE 669 Parallel Computer Architecture Lecture 16 Interconnection Topology

ECE669 L16: Interconnection Topology March 30, 2004 Interconnection Topologies °Class networks scaling with N °Logical Properties: distance, degree °Physical properties length, width °Fully connected network diameter = 1 degree = N cost? -bus => O(N), but BW is O(1) - actually worse -crossbar => O(N 2 ) for BW O(N) °VLSI technology determines switch degree

ECE669 L16: Interconnection Topology March 30, 2004 Linear Arrays and Rings °Linear Array Diameter? Average Distance? Bisection bandwidth? Route A -> B given by relative address R = B-A °Torus? °Examples: FDDI, SCI, KSR1

ECE669 L16: Interconnection Topology March 30, 2004 Multidimensional Meshes and Tori °n-dimensional k-ary mesh: N = k n k = n  N described by n-vector of radix k coordinate °n-dimensional k-ary torus (or k-ary n-cube)? 2D Grid 3D Cube

ECE669 L16: Interconnection Topology March 30, 2004 Real World 2D mesh °1824 node Paragon: 16 x 114 array

ECE669 L16: Interconnection Topology March 30, 2004 Trees °Diameter and ave distance logarithmic k-ary tree, height d = log k N address specified d-vector of radix k coordinates describing path down from root °Fixed degree °H-tree space is O(N) with O(  N) long wires °Bisection BW?

ECE669 L16: Interconnection Topology March 30, 2004 Fat-Trees °Fatter links (really more of them) as you go up, so bisection BW scales with N

ECE669 L16: Interconnection Topology March 30, 2004 Butterflies °Tree with lots of roots! °N log N (actually N/2 x logN) °Exactly one route from any source to any dest °Bisection N/2 16 node butterfly building block

ECE669 L16: Interconnection Topology March 30, 2004 Benes network and Fat Tree °Back-to-back butterfly can route all permutations off line

ECE669 L16: Interconnection Topology March 30, 2004 Hypercubes °Also called binary n-cubes. # of nodes = N = 2 n. °O(logN) Hops °Good bisection BW °Complexity Out degree is n = logN correct dimensions in order with random comm. 2 ports per processor 0-D1-D2-D3-D 4-D 5-D !

ECE669 L16: Interconnection Topology March 30, 2004 Relationship: ButterFlies to Hypercubes °Wiring is isomorphic °Except that Butterfly always takes log n steps

ECE669 L16: Interconnection Topology March 30, 2004 Toplology Summary °All have some “bad permutations” many popular permutations are very bad for meshs (transpose) ramdomness in wiring or routing makes it hard to find a bad one! TopologyDegreeDiameterAve DistBisectionD (D P=1024 1D Array2N-1N / 31huge 1D Ring2N/2N/42 2D Mesh42 (N 1/2 - 1)2/3 N 1/2 N 1/2 63 (21) 2D Torus4N 1/2 1/2 N 1/2 2N 1/2 32 (16) k-ary n-cube2nnk/2nk/4nk/415 Hypercuben =log Nnn/2N/210 (5)

ECE669 L16: Interconnection Topology March 30, 2004 Real Machines °Wide links, smaller routing delay °Tremendous variation