Computer Science and Engineering Copyright by Hesham El-Rewini Advanced Computer Architecture CSE 8383 February 14 2006 Session 9.

Slides:



Advertisements
Similar presentations
SE-292 High Performance Computing
Advertisements

Classification of Distributed Systems Properties of Distributed Systems n motivation: advantages of distributed systems n classification l architecture.
Taxanomy of parallel machines. Taxonomy of parallel machines Memory – Shared mem. – Distributed mem. Control – SIMD – MIMD.
Multiprocessors CSE 4711 Multiprocessors - Flynn’s Taxonomy (1966) Single Instruction stream, Single Data stream (SISD) –Conventional uniprocessor –Although.
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)
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 Computing Platforms
Lecture 10 Outline Material from Chapter 2 Interconnection networks Processor arrays Multiprocessors Multicomputers Flynn’s taxonomy.
Models of Parallel Computation Advanced Algorithms & Data Structures Lecture Theme 12 Prof. Dr. Th. Ottmann Summer Semester 2006.
Interconnection Network Topologies
Course Outline Introduction in algorithms and applications Parallel machines and architectures Overview of parallel machines, trends in top-500 Cluster.
Parallel Processing Group Members: PJ Kulick Jon Robb Brian Tobin.
1 Static Interconnection Networks CEG 4131 Computer Architecture III Miodrag Bolic.
Introduction to Parallel Processing Ch. 12, Pg
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.
1 Parallel computing and its recent topics. 2 Outline 1. Introduction of parallel processing (1)What is parallel processing (2)Classification of parallel.
Course Outline Introduction in software and applications. Parallel machines and architectures –Overview of parallel machines –Cluster computers (Myrinet)
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.
CHAPTER 12 INTRODUCTION TO PARALLEL PROCESSING CS 147 Guy Wong page
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Parallel Programming in C with MPI and OpenMP Michael J. Quinn.
1 Dynamic Interconnection Networks Miodrag Bolic.
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.
Computer Science and Engineering Parallel and Distributed Processing CSE 8380 January Session 4.
An Overview of Parallel Computing. Hardware There are many varieties of parallel computing hardware and many different architectures The original classification.
Course Outline Introduction in algorithms and applications Parallel machines and architectures Overview of parallel machines, trends in top-500, clusters,
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
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 Copyright by Hesham El-Rewini Advanced Computer Architecture CSE 8383 February Session 13.
Lecture 3: Computer Architectures
Parallel Processing Presented by: Wanki Ho CS147, Section 1.
Computer Science and Engineering Copyright by Hesham El-Rewini Advanced Computer Architecture CSE 8383 February Session 10.
Computer Science and Engineering Copyright by Hesham El-Rewini Advanced Computer Architecture CSE 8383 May 2, 2006 Session 29.
Spring EE 437 Lillevik 437s06-l22 University of Portland School of Engineering Advanced Computer Architecture Lecture 22 Distributed computer Interconnection.
Computer Science and Engineering Parallel and Distributed Processing CSE 8380 April 28, 2005 Session 29.
COMP8330/7330/7336 Advanced Parallel and Distributed Computing Tree-Based Networks Cache Coherence Dr. Xiao Qin Auburn University
Array computers. Single Instruction Stream Multiple Data Streams computer There two types of general structures of array processors SIMD Distributerd.
Interconnection Networks Communications Among Processors.
Computer Science and Engineering Copyright by Hesham El-Rewini Advanced Computer Architecture CSE 8383 February Session 11.
Lecture 13 Parallel Processing. 2 What is Parallel Computing? Traditionally software has been written for serial computation. Parallel computing is the.
INTERCONNECTION NETWORK
Parallel Architecture
Distributed and Parallel Processing
Connection System Serve on mutual connection processors and memory .
Interconnection topologies
Course Outline Introduction in algorithms and applications
Multiprocessors Interconnection Networks
Parallel Architectures Based on Parallel Computing, M. J. Quinn
Mesh-Connected Illiac Networks
Static Interconnection Networks
High Performance Computing & Bioinformatics Part 2 Dr. Imad Mahgoub
Advanced Computer and Parallel Processing
Interconnection Networks Contd.
Birds Eye View of Interconnection Networks
Advanced Computer and Parallel Processing
Static Interconnection Networks
Presentation transcript:

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 Contents  Four Decades of Computing  Flynn’s Taxonomy  SIMD & MIMD Organization  Interconnection Networks

Computer Science and Engineering Copyright by Hesham El-Rewini Four Decades of Computing FeatureBatchTime-SharingDesktopNetwork Decade1960s1970s1980s1990s LocationComputer Room Terminal RoomDesktopMobile UsersExpertsSpecialistsIndividualsGroups DataAlphanumericText, numbersFont,GraphsMultimedia ObjectiveCalculateAccessPresentCommunicat e InterfacePunched CardKeyboard, CRTSee & PointAsk & Tell OperationProcessEditLayoutOrchestrate ConnectivityNonePeripheral Cable LANInternet OwnersCorporate Computer Ctrs Divisional IS Shops Dept. End Users Everyone

Computer Science and Engineering Copyright by Hesham El-Rewini Flynn’s Taxonomy  Single Instruction Single Data (SISD)  Single Instruction Multiple Data (SIMD)  Multiple Instruction Multiple Data (MIMD)  Multiple Instruction Single Data (MISD)

Computer Science and Engineering Copyright by Hesham El-Rewini SISD Control Unit Instruction Stream Processor (P) Memory (M) I/O Instruction Stream Data Stream

Computer Science and Engineering Copyright by Hesham El-Rewini SIMD PnPn P1P1 Mn Control Unit Program loaded from front end M1M1 Data Stream Instruction Stream Data loaded from front end

Computer Science and Engineering Copyright by Hesham El-Rewini MIMD P1P1 Control Unit-1 M1M1 Data Stream Instruction Stream PnPn Control Unit-n MnMn Data Stream Instruction Stream

Computer Science and Engineering Copyright by Hesham El-Rewini SIMD Computers Processor Memory P M P M P M P M P M P M P M P M P M P M P M P M P M P M P M P M von Neumann Computer Some Interconnection Network

Computer Science and Engineering Copyright by Hesham El-Rewini SIMD - 1 Control Unit P1P1 M1M1 P2P2 M2M2 P3P3 M3M3 PnPn MnMn P n-1 M n-1 Interconnection Network

Computer Science and Engineering Copyright by Hesham El-Rewini SIMD –2 Control Unit P1P1 M1M1 P2P2 M2M2 P3P3 M3M3 PnPn MnMn P n-1 M n-1 Interconnection Network

Computer Science and Engineering Copyright by Hesham El-Rewini MIMD Shared Memory Interconnection Network P MMMM PPP

Computer Science and Engineering Copyright by Hesham El-Rewini Bus Based & switch based SM Systems Global Memory P C P C P C P C P C P C P C MMMM

Computer Science and Engineering Copyright by Hesham El-Rewini MIMD Message Passing Interconnection Network P MMMM PPP

Computer Science and Engineering Copyright by Hesham El-Rewini 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 Copyright by Hesham El-Rewini Interconnection Network Taxonomy Interconnection Network Static Dynamic Bus-basedSwitch-based 1-D2-DHC SingleMultiple SSMS Crossbar

Computer Science and Engineering Copyright by Hesham El-Rewini Static IN

Computer Science and Engineering Copyright by Hesham El-Rewini 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 Copyright by Hesham El-Rewini Examples of Network Topology Linear Array Ring Mesh Fully Connected

Computer Science and Engineering Copyright by Hesham El-Rewini Hypercube d = 0d = 1d = 2d =

Computer Science and Engineering Copyright by Hesham El-Rewini 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 Copyright by Hesham El-Rewini Hypercubes S d = 4

Computer Science and Engineering Copyright by Hesham El-Rewini Analysis and performance metrics static networks K x log 2 NYesnN n  k/2  2nK-ary n-cube NN No2(N-n)2(n-1)42D-Mesh log 2 NYesnN/2log 2 N n-cube log 2 NNoN-1 2(  log 2 N  –1) 3Binary Tree NNoN-1 2Linear Array 1YesN(N-1)/21N-1CCNs Worst delay Symmetr y CostDiameter(D)Degree(d)Network

Computer Science and Engineering Copyright by Hesham El-Rewini Dynamic IN

Computer Science and Engineering Copyright by Hesham El-Rewini Bus Based IN Global Memory P P C P C P C P P

Computer Science and Engineering Copyright by Hesham El-Rewini 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 Copyright by Hesham El-Rewini Dynamic Networks StraightExchange Upper-broadcast Lower-broadcast The different setting of the 2X2 SE

Computer Science and Engineering Copyright by Hesham El-Rewini Multi-stage network

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

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

Computer Science and Engineering Copyright by Hesham El-Rewini Analysis and performance metrics dynamic networks 0NoO(N 2 )O(1)Crossbar 0YesO(NlogN)O(logN)MINs (m-1)YesO(m)O(mN)Multiple-bus 0YesO(1)O(N)Bus Degree of FTBlockingCostDelayNetworks