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

Slides:



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

Shantanu Dutt Univ. of Illinois at Chicago
Taxanomy of parallel machines. Taxonomy of parallel machines Memory – Shared mem. – Distributed mem. Control – SIMD – MIMD.
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)
1 Lecture 23: Interconnection Networks Topics: communication latency, centralized and decentralized switches (Appendix E)
Advanced Topics in Algorithms and Data Structures An overview of the lecture 2 Models of parallel computation Characteristics of SIMD models Design issue.
1 CSE 591-S04 (lect 14) Interconnection Networks (notes by Ken Ryu of Arizona State) l Measure –How quickly it can deliver how much of what’s needed to.
Parallel Routing Bruce, Chiu-Wing Sham. Overview Background Routing in parallel computers Routing in hypercube network –Bit-fixing routing algorithm –Randomized.
NUMA Mult. CSE 471 Aut 011 Interconnection Networks for Multiprocessors Buses have limitations for scalability: –Physical (number of devices that can be.
Interconnection Network PRAM Model is too simple Physically, PEs communicate through the network (either buses or switching networks) Cost depends on network.
Parallel Computing Platforms
7. Fault Tolerance Through Dynamic or Standby Redundancy 7.6 Reconfiguration in Multiprocessors Focused on permanent and transient faults detection. Three.
Models of Parallel Computation Advanced Algorithms & Data Structures Lecture Theme 12 Prof. Dr. Th. Ottmann Summer Semester 2006.
Interconnection Network Topologies
Examples Broadcasting and Gossiping. Broadcast on ring (Safe and Forward)
The importance of switching in communication The cost of switching is high Definition: Transfer input sample points to the correct output ports at the.
Course Outline Introduction in algorithms and applications Parallel machines and architectures Overview of parallel machines, trends in top-500 Cluster.
1 CSE SUNY New Paltz Chapter Nine Multiprocessors.
Interconnection Network Topology Design Trade-offs
1 Lecture 25: Interconnection Networks Topics: communication latency, centralized and decentralized switches, routing, deadlocks (Appendix E) Review session,
1 Static Interconnection Networks CEG 4131 Computer Architecture III Miodrag Bolic.
ECE669 L16: Interconnection Topology March 30, 2004 ECE 669 Parallel Computer Architecture Lecture 16 Interconnection Topology.
Chapter 5 Array Processors. Introduction  Major characteristics of SIMD architectures –A single processor(CP) –Synchronous array processors(PEs) –Data-parallel.
Interconnect Network Topologies
Interconnection Networks. Applications of Interconnection Nets Interconnection networks are used everywhere! ◦ Supercomputers – connecting the processors.
Course Outline Introduction in software and applications. Parallel machines and architectures –Overview of parallel machines –Cluster computers (Myrinet)
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.
Parallel Computing Basic Concepts Computational Models Synchronous vs. Asynchronous The Flynn Taxonomy Shared versus Distributed Memory Interconnection.
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.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Parallel Programming in C with MPI and OpenMP Michael J. Quinn.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Parallel Programming in C with MPI and OpenMP Michael J. Quinn.
Lecture 3 Innerconnection Networks for Parallel Computers
شبکه های میان ارتباطی 1 به نام خدا دکتر محمد کاظم اکبری مرتضی سرگلزایی جوان
Anshul Kumar, CSE IITD CSL718 : Multiprocessors Interconnection Mechanisms Performance Models 20 th April, 2006.
Computer Science and Engineering Copyright by Hesham El-Rewini Advanced Computer Architecture.
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,
Computer Science and Engineering Copyright by Hesham El-Rewini Advanced Computer Architecture.
Computer Science and Engineering Advanced Computer Architecture CSE 8383 February Session 6.
Super computers Parallel Processing
Computer Science and Engineering Copyright by Hesham El-Rewini Advanced Computer Architecture CSE 8383 February Session 9.
Computer Science and Engineering Copyright by Hesham El-Rewini Advanced Computer Architecture CSE 8383 February Session 10.
INTERCONNECTION NETWORKS Work done as part of Parallel Architecture Under the guidance of Dr. Edwin Sha By Gomathy Gowri Narayanan Karthik Alagu Dynamic.
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.
Computer Science and Engineering Copyright by Hesham El-Rewini Advanced Computer Architecture CSE 8383 February Session 11.
INTERCONNECTION NETWORK
Computer Network Topology
Auburn University COMP8330/7330/7336 Advanced Parallel and Distributed Computing Interconnection Networks (Part 2) Dr.
Dynamic connection system
Connection System Serve on mutual connection processors and memory .
Interconnection topologies
Multiprocessors Interconnection Networks
Interconnection Network Design Lecture 14
Mesh-Connected Illiac Networks
Static Interconnection Networks
High Performance Computing & Bioinformatics Part 2 Dr. Imad Mahgoub
Advanced Computer and Parallel Processing
Interconnection Networks Contd.
Multiprocessors Interconnection Networks
Birds Eye View of Interconnection Networks
Advanced Computer and Parallel Processing
Static Interconnection Networks
Presentation transcript:

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

Computer Science and Engineering Contents  Interconnection Networks  Static IN  Dynamic IN

Computer Science and Engineering Interconnection Network  Mode of Operation (Synchronous vs. Asynchronous)  Control Strategy (Centralized vs. Decentralized)  Switching Techniques (Packet switching vs. Circuit switching)  Topology (Static Vs. Dynamic)

Computer Science and Engineering Interconnection Network Taxonomy Interconnection Network Static Dynamic Bus-basedSwitch-based 1-D2-DHC SingleMultiple SSMS Crossbar

Computer Science and Engineering Static IN

Computer Science and Engineering Static Interconnection Networks  Static (fixed) interconnection networks are characterized by having fixed paths, unidirectional or bi-directional, between processors.  Completely connected networks (CCNs): Number of links: O(N 2 ), delay complexity: O(1).  Limited connected network (LCNs) Linear arrays Ring (Loop) networks Two-dimensional arrays Tree networks Cube network

Computer Science and Engineering Examples of Network Topology Linear Array Ring Mesh Fully Connected

Computer Science and Engineering Hypercube d = 0d = 1d = 2d =

Computer Science and Engineering Hypercube of dimension d n = 2 d d = log n Node degree = d Number of bits to label a node = d Diameter = d Number of edges = n*d/2 Hamming distance! Routing

Computer Science and Engineering Hypercubes S d = 4

Computer Science and Engineering Analysis and performance metrics static networks NetworkDegree(d)Diameter(D)CostSymmetryWorst delay CCNsN-11N(N-1)/2Yes1 Linear Array2N-1 NoN Binary Tree3 2(  log 2 N  –1) N-1Nolog 2 N n-cubelog 2 N nN/2Yeslog 2 N 2D-Mesh42(n-1)2(N-n)No NN K-ary n-cube2n n  k/2  nNYesK x log 2 N

Computer Science and Engineering Dynamic IN

Computer Science and Engineering Bus Based IN Global Memory P P C P C P C P P

Computer Science and Engineering Dynamic Interconnection Network Crossbar network An 8X8 Crossbar Network M1 M2 M3 M4 M5 M6 M7 M8 P1 P2 P3 P4 P5 P6 P7 P8

Computer Science and Engineering Dynamic Networks StraightExchange Upper-broadcast Lower-broadcast The different setting of the 2X2 SE

Computer Science and Engineering Multi-stage network

Computer Science and Engineering Dynamic Interconnection Network Multi-stage INs (MINs) An example 8X8 Shuffle-Exchange network (SEN)

Computer Science and Engineering Dynamic Interconnection Network Multi-stage INs (MINs) (cont.) An 8X8 Banyan network

Computer Science and Engineering Analysis and performance metrics dynamic networks NetworksDelayCostBlockin g Degree of FT BusO(N)O(1)Yes0 Multiple-busO(mN)O(m)Yes(m-1) MINsO(logN)O(NlogN)Yes0 CrossbarO(1)O(N 2 )No0

Feedback: Privacy Policy Feedback
Do Not Sell My Personal Information
About project: SlidePlayer Terms of Service

© 2025 SlidePlayer.com. Inc. All rights reserved.