Design of Digital Circuits Lecture 20: SIMD Processors. Prof. Onur Mutlu ETH Zurich Spring May 2017

Transcription

1 Design of Digital Circuits Lecture 20: SIMD Processors Prof. Onur Mutlu ETH Zurich Spring May 2017

2 Agenda for Today & Next Few Lectures! Single-cycle Microarchitectures! Multi-cycle and Microprogrammed Microarchitectures! Pipelining! Issues in Pipelining: Control & Data Dependence Handling, State Maintenance and Recovery,! Out-of-Order Execution! Other Execution Paradigms 2

3 Readings for Today! Lindholm et al., "NVIDIA Tesla: A Unified Graphics and Computing Architecture," IEEE Micro

4 Lecture Announcement! May 15, 2017! 17:15-18:15! HG F 30, Audi Max! Onur Mutlu! Inaugural Lecture! Future Computing Architectures! details.html?eventfeedid=

5 Other Approaches to Concurrency (or Instruction Level Parallelism)

6 Approaches to (Instruction-Level) Concurrency! Pipelining! Out-of-order execution! Dataflow (at the ISA level)! Superscalar Execution! VLIW! SIMD Processing (Vector and array processors, GPUs)! Decoupled Access Execute! Systolic Arrays 6

7 SIMD Processing: Exploiting Regular (Data) Parallelism

8 Review: SIMD Processing! Single instruction operates on multiple data elements " In time or in space! Multiple processing elements! Time-space duality " Array processor: Instruction operates on multiple data elements at the same time using different spaces " Vector processor: Instruction operates on multiple data elements in consecutive time steps using the same space 8

9 Review: Array vs. Vector Processors ARRAY PROCESSOR VECTOR PROCESSOR Instruction Stream LD VR # A[3:0] ADD VR # VR, 1 MUL VR # VR, 2 ST A[3:0] # VR Time Same same time Different time LD0 LD1 LD2 LD3 LD0 AD0 AD1 AD2 AD3 LD1 AD0 MU0 MU1 MU2 MU3 LD2 AD1 MU0 ST0 ST1 ST2 ST3 LD3 AD2 MU1 ST0 Different same space AD3 MU2 ST1 MU3 ST2 Same space ST3 Space Space 9

10 Review: SIMD Array Processing vs. VLIW! VLIW: Multiple independent operations packed together by the compiler 10

11 Review: SIMD Array Processing vs. VLIW! Array processor: Single operation on multiple (different) data elements 11

12 Review: Vector Processors! A vector is a one-dimensional array of numbers! Many scientific/commercial programs use vectors for (i = 0; i<=49; i++) C[i] = (A[i] + B[i]) / 2! A vector processor is one whose instructions operate on vectors rather than scalar (single data) values! Basic requirements " Need to load/store vectors $ vector registers (contain vectors) " Need to operate on vectors of different lengths $ vector length register (VLEN) " Elements of a vector might be stored apart from each other in memory $ vector stride register (VSTR)! Stride: distance between two elements of a vector 12

13 Review: Vector Processors (II)! A vector instruction performs an operation on each element in consecutive cycles " Vector functional units are pipelined " Each pipeline stage operates on a different data element! Vector instructions allow deeper pipelines " No intra-vector dependencies $ no hardware interlocking needed within a vector " No control flow within a vector " Known stride allows easy address calculation for all vector elements! Enables prefetching of vectors into registers/cache/memory 13

14 Vector Processor Advantages + No dependencies within a vector " Pipelining. parallelization work really well " Can have very deep pipelines, no dependencies! + Each instruction generates a lot of work " Reduces instruction fetch bandwidth requirements + Highly regular memory access pattern + No need to explicitly code loops " Fewer branches in the instruction sequence 14

15 Vector Processor Disadvantages -- Works (only) if parallelism is regular (data/simd parallelism) ++ Vector operations -- Very inefficient if parallelism is irregular -- How about searching for a key in a linked list? Fisher, Very Long Instruction Word architectures and the ELI-512, ISCA

16 Vector Processor Limitations -- Memory (bandwidth) can easily become a bottleneck, especially if 1. compute/memory operation balance is not maintained 2. data is not mapped appropriately to memory banks 16

17 Vector Processing in More Depth

18 Vector Registers! Each vector data register holds N M-bit values! Vector control registers: VLEN, VSTR, VMASK! Maximum VLEN can be N " Maximum number of elements stored in a vector register! Vector Mask Register (VMASK) " Indicates which elements of vector to operate on " Set by vector test instructions! e.g., VMASK[i] = (V k [i] == 0) V0,0 V0,1 M-bit wide V1,0 V1,1 M-bit wide V0,N-1 V1,N-1 18

19 Vector Functional Units! Use deep pipeline to execute element operations $ fast clock cycle V 1 V 2 V 3! Control of deep pipeline is simple because elements in vector are independent Six stage multiply pipeline V1 * V2 $ V3 Slide credit: Krste Asanovic 19

20 Vector Machine Organization (CRAY-1)! CRAY-1! Russell, The CRAY-1 computer system, CACM 1978.! Scalar and vector modes! 8 64-element vector registers! 64 bits per element! 16 memory banks! 8 64-bit scalar registers! 8 24-bit address registers 20

21 Loading/Storing Vectors from/to Memory! Requires loading/storing multiple elements! Elements separated from each other by a constant distance (stride) " Assume stride = 1 for now! Elements can be loaded in consecutive cycles if we can start the load of one element per cycle " Can sustain a throughput of one element per cycle! Question: How do we achieve this with a memory that takes more than 1 cycle to access?! Answer: Bank the memory; interleave the elements across banks 21

22 Memory Banking! Memory is divided into banks that can be accessed independently; banks share address and data buses (to minimize pin cost)! Can start and complete one bank access per cycle! Can sustain N parallel accesses if all N go to different banks Bank 0 Bank 1 Bank 2 Bank 15 MDR MAR MDR MAR MDR MAR MDR MAR Data bus Address bus Picture credit: Derek Chiou CPU 22

23 Vector Memory System! Next address = Previous address + Stride! If stride = 1 & consecutive elements interleaved across banks & number of banks >= bank latency, then can sustain 1 element/cycle throughput Vector Registers Base Stride Address Generator A B C D E F Memory Banks Picture credit: Krste Asanovic 23

24 Scalar Code Example! For I = 0 to 49 " C[i] = (A[i] + B[i]) / 2! Scalar code (instruction and its latency) MOVI R0 = 50 1 MOVA R1 = A 1 MOVA R2 = B 1 MOVA R3 = C dynamic instructions X: LD R4 = MEM[R1++] 11 ;autoincrement addressing LD R5 = MEM[R2++] 11 ADD R6 = R4 + R5 4 SHFR R7 = R6 >> 1 1 ST MEM[R3++] = R7 11 DECBNZ R0, X 2 ;decrement and branch if NZ 24

25 Scalar Code Execution Time (In Order)! Scalar execution time on an in-order processor with 1 bank " First two loads in the loop cannot be pipelined: 2*11 cycles " *40 = 2004 cycles! Scalar execution time on an in-order processor with 16 banks (word-interleaved: consecutive words are stored in consecutive banks) " First two loads in the loop can be pipelined " *30 = 1504 cycles! Why 16 banks? " 11 cycle memory access latency " Having 16 (>11) banks ensures there are enough banks to overlap enough memory operations to cover memory latency 25

26 Vectorizable Loops! A loop is vectorizable if each iteration is independent of any other! For I = 0 to 49 " C[i] = (A[i] + B[i]) / 2! Vectorized loop (each instruction and its latency): MOVI VLEN = 50 1 MOVI VSTR = 1 1 VLD V0 = A 11 + VLEN - 1 VLD V1 = B 11 + VLEN 1 VADD V2 = V0 + V1 4 + VLEN - 1 VSHFR V3 = V2 >> VLEN - 1 VST C = V VLEN 1 7 dynamic instructions 26

27 Basic Vector Code Performance! Assume no chaining (no vector data forwarding) " i.e., output of a vector functional unit cannot be used as the direct input of another " The entire vector register needs to be ready before any element of it can be used as part of another operation! One memory port (one address generator)! 16 memory banks (word-interleaved) V0 = A[0..49] V1 = B[0..49] ADD SHIFT STORE! 285 cycles 27

28 Vector Chaining! Vector chaining: Data forwarding from one vector functional unit to another LV v1 MULV v3,v1,v2 ADDV v5, v3, v4 V1 V 2 V 3 V 4 V 5 Chain Chain Load Unit Memory Mult. Add Slide credit: Krste Asanovic 28

29 Vector Code Performance - Chaining! Vector chaining: Data forwarding from one vector functional unit to another These two VLDs cannot be pipelined. WHY? Strict assumption: Each memory bank has a single port (memory bandwidth bottleneck) 11 49! 182 cycles VLD and VST cannot be pipelined. WHY? 29

30 Vector Code Performance Multiple Memory Ports! Chaining and 2 load ports, 1 store port in each bank ! 79 cycles! 19X perf. improvement!

31 Questions (I)! What if # data elements > # elements in a vector register? " Idea: Break loops so that each iteration operates on # elements in a vector register! E.g., 527 data elements, 64-element VREGs! 8 iterations where VLEN = 64! 1 iteration where VLEN = 15 (need to change value of VLEN) " Called vector stripmining! What if vector data is not stored in a strided fashion in memory? (irregular memory access to a vector) " Idea: Use indirection to combine/pack elements into vector registers " Called scatter/gather operations 31

32 Gather/Scatter Operations Want to vectorize loops with indirect accesses: for (i=0; i<n; i++) A[i] = B[i] + C[D[i]] Indexed load instruction (Gather) LV vd, rd # Load indices in D vector LVI vc, rc, vd # Load indirect from rc base LV vb, rb # Load B vector ADDV.D va,vb,vc # Do add SV va, ra # Store result 32

33 Gather/Scatter Operations! Gather/scatter operations often implemented in hardware to handle sparse vectors (matrices)! Vector loads and stores use an index vector which is added to the base register to generate the addresses Index Vector Data Vector (to Store) Stored Vector (in Memory) Base Base+1 X Base Base+3 X Base+4 X Base+5 X Base Base

34 Conditional Operations in a Loop! What if some operations should not be executed on a vector (based on a dynamically-determined condition)? loop: for (i=0; i<n; i++) if (a[i]!= 0) then b[i]=a[i]*b[i]! Idea: Masked operations " VMASK register is a bit mask determining which data element should not be acted upon VLD V0 = A VLD V1 = B VMASK = (V0!= 0) VMUL V1 = V0 * V1 VST B = V1 " This is predicated execution. Execution is predicated on mask bit. 34

35 Another Example with Masking for (i = 0; i < 64; ++i) if (a[i] >= b[i]) c[i] = a[i] else c[i] = b[i] A B VMASK Steps to execute the loop in SIMD code 1. Compare A, B to get VMASK 2. Masked store of A into C 3. Complement VMASK 4. Masked store of B into C 35

36 Masked Vector Instructions Simple Implementation execute all N operations, turn off result writeback according to mask Density-Time Implementation scan mask vector and only execute elements with non-zero masks M[7]=1 A[7] B[7] M[7]=1 M[6]=0 M[5]=1 A[6] A[5] B[6] B[5] M[6]=0 M[5]=1 A[7] B[7] M[4]=1 M[3]=0 A[4] A[3] B[4] B[3] M[4]=1 M[3]=0 C[5] M[2]=0 C[4] M[2]=0 M[1]=1 C[2] C[1] M[1]=1 M[0]=0 C[1] Write data port M[0]=0 Write Enable C[0] Write data port Which one is better? Tradeoffs? Slide credit: Krste Asanovic 36

37 Some Issues! Stride and banking " As long as they are relatively prime to each other and there are enough banks to cover bank access latency, we can sustain 1 element/cycle throughput! Storage of a matrix " Row major: Consecutive elements in a row are laid out consecutively in memory " Column major: Consecutive elements in a column are laid out consecutively in memory " You need to change the stride when accessing a row versus column 37

38 38

39 Minimizing Bank Conflicts! More banks! Better data layout to match the access pattern " Is this always possible?! Better mapping of address to bank " E.g., randomized mapping " Rau, Pseudo-randomly interleaved memory, ISCA

40 Array vs. Vector Processors, Revisited! Array vs. vector processor distinction is a purist s distinction! Most modern SIMD processors are a combination of both " They exploit data parallelism in both time and space " GPUs are a prime example we will cover in a bit more detail 40

41 Remember: Array vs. Vector Processors ARRAY PROCESSOR VECTOR PROCESSOR Instruction Stream LD VR # A[3:0] ADD VR # VR, 1 MUL VR # VR, 2 ST A[3:0] # VR Time Same same time Different time LD0 LD1 LD2 LD3 LD0 AD0 AD1 AD2 AD3 LD1 AD0 MU0 MU1 MU2 MU3 LD2 AD1 MU0 ST0 ST1 ST2 ST3 LD3 AD2 MU1 ST0 Different same space AD3 MU2 ST1 MU3 ST2 Same space ST3 Space Space 41

42 Vector Instruction Execution VADD A,B $ C Execution using one pipelined functional unit Execution using four pipelined functional units A[6] B[6] A[24] B[24] A[25] B[25] A[26] B[26] A[27] B[27] A[5] B[5] A[20] B[20] A[21] B[21] A[22] B[22] A[23] B[23] A[4] B[4] A[16] B[16] A[17] B[17] A[18] B[18] A[19] B[19] A[3] B[3] A[12] B[12] A[13] B[13] A[14] B[14] A[15] B[15] C[2] C[8] C[9] C[10] C[11] C[1] C[4] C[5] C[6] C[7] C[0] C[0] C[1] C[2] C[3] Slide credit: Krste Asanovic 42

43 Vector Unit Structure Functional Unit Partitioned Vector Registers Elements 0, 4, 8, Elements 1, 5, 9, Elements 2, 6, 10, Elements 3, 7, 11, Lane Memory Subsystem Slide credit: Krste Asanovic 43

44 Vector Instruction Level Parallelism Can overlap execution of multiple vector instructions " Example machine has 32 elements per vector register and 8 lanes " Completes 24 operations/cycle while issuing 1 vector instruction/cycle Load Unit Multiply Unit Add Unit load mul time add load mul add Instruction issue Slide credit: Krste Asanovic 44

45 Design of Digital Circuits Lecture 20: SIMD Processors Prof. Onur Mutlu ETH Zurich Spring May 2017

46 We did not cover the following slides in lecture. These are for your preparation for the next lecture.

47 Automatic Code Vectorization for (i=0; i < N; i++) C[i] = A[i] + B[i]; Scalar Sequential Code Vectorized Code load load load Iter. 1 add load Time add load add load store store store Iter. 2 load load Iter. 1 Iter. 2 Vector Instruction add store Vectorization is a compile-time reordering of operation sequencing requires extensive loop dependence analysis Slide credit: Krste Asanovic 47

48 Vector/SIMD Processing Summary! Vector/SIMD machines are good at exploiting regular datalevel parallelism " Same operation performed on many data elements " Improve performance, simplify design (no intra-vector dependencies)! Performance improvement limited by vectorizability of code " Scalar operations limit vector machine performance " Remember Amdahl s Law " CRAY-1 was the fastest SCALAR machine at its time!! Many existing ISAs include (vector-like) SIMD operations " Intel MMX/SSEn/AVX, PowerPC AltiVec, ARM Advanced SIMD 48

49 SIMD Operations in Modern ISAs

50 Intel Pentium MMX Operations! Idea: One instruction operates on multiple data elements simultaneously " Ala array processing (yet much more limited) " Designed with multimedia (graphics) operations in mind No VLEN register Opcode determines data type: 8 8-bit bytes 4 16-bit words 2 32-bit doublewords 1 64-bit quadword Stride is always equal to 1. Peleg and Weiser, MMX Technology Extension to the Intel Architecture, IEEE Micro,

51 MMX Example: Image Overlaying (I)! Goal: Overlay the human in image 1 on top of the background in image 2 Peleg and Weiser, MMX Technology Extension to the Intel Architecture, IEEE Micro,

52 MMX Example: Image Overlaying (II) Peleg and Weiser, MMX Technology Extension to the Intel Architecture, IEEE Micro,

53 GPUs (Graphics Processing Units)

54 GPUs are SIMD Engines Underneath! The instruction pipeline operates like a SIMD pipeline (e.g., an array processor)! However, the programming is done using threads, NOT SIMD instructions! To understand this, let s go back to our parallelizable code example! But, before that, let s distinguish between " Programming Model (Software) vs. " Execution Model (Hardware) 54

55 Programming Model vs. Hardware Execution Model! Programming Model refers to how the programmer expresses the code " E.g., Sequential (von Neumann), Data Parallel (SIMD), Dataflow, Multi-threaded (MIMD, SPMD),! Execution Model refers to how the hardware executes the code underneath " E.g., Out-of-order execution, Vector processor, Array processor, Dataflow processor, Multiprocessor, Multithreaded processor,! Execution Model can be very different from the Programming Model " E.g., von Neumann model implemented by an OoO processor " E.g., SPMD model implemented by a SIMD processor (a GPU) 55

56 How Can You Exploit Parallelism Here? for (i=0; i < N; i++) C[i] = A[i] + B[i]; Scalar Sequential Code Iter. 1 load load add store load Let s examine three programming options to exploit instruction-level parallelism present in this sequential code: 1. Sequential (SISD) Iter. 2 add load 2. Data-Parallel (SIMD) store 3. Multithreaded (MIMD/SPMD) 56

57 Prog. Model 1: Sequential (SISD) for (i=0; i < N; i++) C[i] = A[i] + B[i]; Scalar Sequential Code! Can be executed on a: Iter. 1 load load! Pipelined processor! Out-of-order execution processor Iter. 2 add store load load add store " Independent instructions executed when ready " Different iterations are present in the instruction window and can execute in parallel in multiple functional units " In other words, the loop is dynamically unrolled by the hardware! Superscalar or VLIW processor " Can fetch and execute multiple instructions per cycle 57

58 Prog. Model 2: Data Parallel (SIMD) for (i=0; i < N; i++) C[i] = A[i] + B[i]; Scalar Sequential Code Vector Instruction Vectorized Code load load load VLD A $ V1 Iter. 1 load load VLD B $ V2 add add VADD V1 + V2 $ V3 store store VST V3 $ C Iter. 2 load Iter. 1 load Iter. 2 Realization: Each iteration is independent add store Idea: Programmer or compiler generates a SIMD instruction to execute the same instruction from all iterations across different data Best executed by a SIMD processor (vector, array) 58

59 Prog. Model 3: Multithreaded for (i=0; i < N; i++) C[i] = A[i] + B[i]; Scalar Sequential Code load load load Iter. 1 load load Iter. 2 load Iter. 1 add store add store load add store Iter. 2 Realization: Each iteration is independent Idea: Programmer or compiler generates a thread to execute each iteration. Each thread does the same thing (but on different data) Can be executed on a MIMD machine 59

60 Prog. Model 3: Multithreaded for (i=0; i < N; i++) C[i] = A[i] + B[i]; load load load load add store add store Iter. 1 Iter. 2 Realization: Each iteration is independent Idea: This Programmer particular or model compiler is also generates called: a thread to execute each iteration. Each thread does the same SPMD: thing (but Single on Program different data) Multiple Data Can Can be executed be executed on a MIMD on a SIMT SIMD machine machine Single Instruction Multiple Thread 60

61 A GPU is a SIMD (SIMT) Machine! Except it is not programmed using SIMD instructions! It is programmed using threads (SPMD programming model) " Each thread executes the same code but operates a different piece of data " Each thread has its own context (i.e., can be treated/restarted/ executed independently)! A set of threads executing the same instruction are dynamically grouped into a warp (wavefront) by the hardware " A warp is essentially a SIMD operation formed by hardware! 61

62 SPMD on SIMT Machine for (i=0; i < N; i++) C[i] = A[i] + B[i]; load load Warp 0 at PC X load load Warp 0 at PC X+1 add add Warp 0 at PC X+2 store store Warp 0 at PC X+3 Iter. 1 Iter. 2 Warp: A set of threads that execute Realization: Each iteration is independent the same instruction (i.e., at the same PC) Idea: This Programmer particular or model compiler is also generates called: a thread to execute each iteration. Each thread does the same SPMD: thing Single (but on Program different data) Multiple Data Can A GPU Can be executed be executes executed on it a using MIMD on a SIMD the machine SIMT machine model: Single Instruction Multiple Thread 62

63 Graphics Processing Units SIMD not Exposed to Programmer (SIMT)

64 SIMD vs. SIMT Execution Model! SIMD: A single sequential instruction stream of SIMD instructions $ each instruction specifies multiple data inputs " [VLD, VLD, VADD, VST], VLEN! SIMT: Multiple instruction streams of scalar instructions $ threads grouped dynamically into warps " [LD, LD, ADD, ST], NumThreads! Two Major SIMT Advantages: " Can treat each thread separately $ i.e., can execute each thread independently (on any type of scalar pipeline) $ MIMD processing " Can group threads into warps flexibly $ i.e., can group threads that are supposed to truly execute the same instruction $ dynamically obtain and maximize benefits of SIMD processing 64

65 Multithreading of Warps for (i=0; i < N; i++) C[i] = A[i] + B[i];! Assume a warp consists of 32 threads! If you have 32K iterations $ 1K warps! Warps can be interleaved on the same pipeline $ Fine grained multithreading of warps load load Warp 10 at PC X load load add store add store Warp 20 at PC X+2 Iter * Iter *

66 Warps and Warp-Level FGMT! Warp: A set of threads that execute the same instruction (on different data elements) $ SIMT (Nvidia-speak)! All threads run the same code! Warp: The threads that run lengthwise in a woven fabric Thread Warp Scalar Scalar Scalar Thread Thread Thread W X Y Common PC Scalar Thread Z Thread Warp 3 Thread Warp 8 Thread Warp 7 SIMD Pipeline 66

67 High-Level View of a GPU 67

68 Latency Hiding via Warp-Level FGMT! Warp: A set of threads that execute the same instruction (on different data elements)! Fine-grained multithreading " One instruction per thread in pipeline at a time (No interlocking) " Interleave warp execution to hide latencies! Register values of all threads stay in register file! FGMT enables long latency tolerance " Millions of pixels Thread Warp 3 Thread Warp 8 Thread Warp 7 R F A L U All Hit? I-Fetch Decode R F A L U D-Cache Writeback Data R F A L U Warps available for scheduling SIMD Pipeline Warps accessing memory hierarchy Miss? Thread Warp 1 Thread Warp 2 Thread Warp 6 Slide credit: Tor Aamodt 68

69 Warp Execution (Recall the Slide) 32-thread warp executing ADD A[tid],B[tid] $ C[tid] Execution using one pipelined functional unit Execution using four pipelined functional units A[6] B[6] A[24] B[24] A[25] B[25] A[26] B[26] A[27] B[27] A[5] B[5] A[20] B[20] A[21] B[21] A[22] B[22] A[23] B[23] A[4] B[4] A[16] B[16] A[17] B[17] A[18] B[18] A[19] B[19] A[3] B[3] A[12] B[12] A[13] B[13] A[14] B[14] A[15] B[15] C[2] C[8] C[9] C[10] C[11] C[1] C[4] C[5] C[6] C[7] C[0] C[0] C[1] C[2] C[3] Slide credit: Krste Asanovic 69

70 SIMD Execution Unit Structure Functional Unit Registers for each Thread Registers for thread IDs 0, 4, 8, Registers for thread IDs 1, 5, 9, Registers for thread IDs 2, 6, 10, Registers for thread IDs 3, 7, 11, Lane Memory Subsystem Slide credit: Krste Asanovic 70

71 Warp Instruction Level Parallelism Can overlap execution of multiple instructions " Example machine has 32 threads per warp and 8 lanes " Completes 24 operations/cycle while issuing 1 warp/cycle Load Unit Multiply Unit Add Unit W0 W1 time W2 W3 W4 W5 Warp issue Slide credit: Krste Asanovic 71

72 SIMT Memory Access! Same instruction in different threads uses thread id to index and access different data elements Let s assume N=16, 4 threads per warp $ 4 warps Threads Data elements Warp 0 Warp 1 Warp 2 Warp 3 Slide credit: Hyesoon Kim

73 Sample GPU SIMT Code (Simplified) CPU code for (ii = 0; ii < ; ++ii) { C[ii] = A[ii] + B[ii]; } CUDA code // there are threads global void KernelFunction( ) { int tid = blockdim.x * blockidx.x + threadidx.x; int vara = aa[tid]; int varb = bb[tid]; C[tid] = vara + varb; } Slide credit: Hyesoon Kim

74 Sample GPU Program (Less Simplified) Slide credit: Hyesoon Kim 74

75 Warp-based SIMD vs. Traditional SIMD! Traditional SIMD contains a single thread " Lock step: a vector instruction needs to finish before another can start " Programming model is SIMD (no extra threads) $ SW needs to know vector length " ISA contains vector/simd instructions! Warp-based SIMD consists of multiple scalar threads executing in a SIMD manner (i.e., same instruction executed by all threads) " Does not have to be lock step " Each thread can be treated individually (i.e., placed in a different warp) $ programming model not SIMD! SW does not need to know vector length! Enables multithreading and flexible dynamic grouping of threads " ISA is scalar $ vector instructions can be formed dynamically " Essentially, it is SPMD programming model implemented on SIMD hardware 75

76 SPMD! Single procedure/program, multiple data " This is a programming model rather than computer organization! Each processing element executes the same procedure, except on different data elements " Procedures can synchronize at certain points in program, e.g. barriers! Essentially, multiple instruction streams execute the same program " Each program/procedure 1) works on different data, 2) can execute a different control-flow path, at run-time " Many scientific applications are programmed this way and run on MIMD hardware (multiprocessors) " Modern GPUs programmed in a similar way on a SIMD hardware 76

77 SIMD vs. SIMT Execution Model! SIMD: A single sequential instruction stream of SIMD instructions $ each instruction specifies multiple data inputs " [VLD, VLD, VADD, VST], VLEN! SIMT: Multiple instruction streams of scalar instructions $ threads grouped dynamically into warps " [LD, LD, ADD, ST], NumThreads! Two Major SIMT Advantages: " Can treat each thread separately $ i.e., can execute each thread independently on any type of scalar pipeline $ MIMD processing " Can group threads into warps flexibly $ i.e., can group threads that are supposed to truly execute the same instruction $ dynamically obtain and maximize benefits of SIMD processing 77

78 Threads Can Take Different Paths in Warp-based SIMD! Each thread can have conditional control flow instructions! Threads can execute different control flow paths A C B D F Thread Warp Thread 1 Thread 2 Thread 3 Common PC Thread 4 E G Slide credit: Tor Aamodt 78

79 Control Flow Problem in GPUs/SIMT! A GPU uses a SIMD pipeline to save area on control logic. " Groups scalar threads into warps! Branch divergence occurs when threads inside warps branch to different execution paths. Branch Path A Path B This is the same as conditional execution. Recall the Vector Mask and Masked Vector Operations? Slide credit: Tor Aamodt 79

80 Remember: Each Thread Is Independent! Two Major SIMT Advantages: " Can treat each thread separately $ i.e., can execute each thread independently on any type of scalar pipeline $ MIMD processing " Can group threads into warps flexibly $ i.e., can group threads that are supposed to truly execute the same instruction $ dynamically obtain and maximize benefits of SIMD processing! If we have many threads! We can find individual threads that are at the same PC! And, group them together into a single warp dynamically! This reduces divergence $ improves SIMD utilization " SIMD utilization: fraction of SIMD lanes executing a useful operation (i.e., executing an active thread) 80

81 Dynamic Warp Formation/Merging! Idea: Dynamically merge threads executing the same instruction (after branch divergence)! Form new warps from warps that are waiting " Enough threads branching to each path enables the creation of full new warps Warp X Warp Z Warp Y 81

82 Dynamic Warp Formation/Merging! Idea: Dynamically merge threads executing the same instruction (after branch divergence) Branch Path A Path B! Fung et al., Dynamic Warp Formation and Scheduling for Efficient GPU Control Flow, MICRO

83 Dynamic Warp Formation Example B x/1110 y/0011 A x/1111 y/1111 C x/1000 y/0010 D x/0110 y/0001 F x/0001 y/1100 E x/1110 y/0011 A D Legend A Execution of Warp x at Basic Block A A new warp created from scalar threads of both Warp x and y executing at Basic Block D Execution of Warp y at Basic Block A Baseline Dynamic Warp Formation G x/1111 y/1111 A A B B C C D D E E F F G G A A A A B B C D E E F G G A A Time Time Slide credit: Tor Aamodt 83

84 Hardware Constraints Limit Flexibility of Warp Grouping Functional Unit Registers for each Thread Registers for thread IDs 0, 4, 8, Registers for thread IDs 1, 5, 9, Registers for thread IDs 2, 6, 10, Registers for thread IDs 3, 7, 11, Lane Can you move any thread flexibly to any lane? Memory Subsystem Slide credit: Krste Asanovic 84

85 An Example GPU

86 NVIDIA GeForce GTX 285! NVIDIA-speak: " 240 stream processors " SIMT execution! Generic speak: " 30 cores " 8 SIMD functional units per core Slide credit: Kayvon Fatahalian 86

87 NVIDIA GeForce GTX 285 core 64 KB of storage for thread contexts (registers) = SIMD functional unit, control shared across 8 units = multiply-add = multiply = instruction stream decode = execution context storage Slide credit: Kayvon Fatahalian 87

88 NVIDIA GeForce GTX 285 core 64 KB of storage for thread contexts (registers)! Groups of 32 threads share instruction stream (each group is a Warp)! Up to 32 warps are simultaneously interleaved! Up to 1024 thread contexts can be stored Slide credit: Kayvon Fatahalian 88

89 NVIDIA GeForce GTX 285 Tex Tex Tex Tex Tex Tex Tex Tex Tex Tex 30 cores on the GTX 285: 30,720 threads Slide credit: Kayvon Fatahalian 89