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

2. Computer Science and Engineering Copyright by Hesham El-Rewini Contents  Four Decades of Computing  Flynn’s Taxonomy  SIMD & MIMD Organization  Interconnection Networks

3. 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

4. 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)

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

6. 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

7. 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

8. 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

9. 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

10. 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

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

12. 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

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

14. 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)

15. 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

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

17. 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

18. Computer Science and Engineering Copyright by Hesham El-Rewini Examples of Network Topology Linear Array Ring Mesh 63 12 54 Fully Connected

19. Computer Science and Engineering Copyright by Hesham El-Rewini Hypercube d = 0d = 1d = 2d = 3 0 1 01 00 11 10 000 001 100110 111 011 101 010

20. 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

21. Computer Science and Engineering Copyright by Hesham El-Rewini Hypercubes 1110 1111 1010 1011 0110 0111 0010 0011 1101 1010 1000 1001 0100 0101 0010 0000 0001 S d = 4

22. 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

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

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

25. 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

26. Computer Science and Engineering Copyright by Hesham El-Rewini Dynamic Networks StraightExchange Upper-broadcast Lower-broadcast The different setting of the 2X2 SE

27. Computer Science and Engineering Copyright by Hesham El-Rewini Multi-stage network 000 001 010 011 100 101 110 111 000 001 010 011 100 101 110 111

28. Computer Science and Engineering Copyright by Hesham El-Rewini Dynamic Interconnection Network Multi-stage INs (MINs) An example 8X8 Shuffle-Exchange network (SEN). 000 001 010 011 100 101 110 111 000 001 010 011 100 101 110 111

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

30. 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