1. CPSC 321 Computer Architecture Spring 2005 Lecture 1 Introduction and Five Components of a Computer Adapted from CS 152 Spring 2002 UC Berkeley Adapted from CPSC 321 Fall 2004 Hank Walker, TAMU

2. Course Instructor Weiping Shi (wshi@ee.tamu.edu)wshi@ee.tamu.edu Class time: MWF 11:30am-12:20pm Office hour: TuF 3:00pm-5:00pm or by appt. 320 WERC, Tel: 458-0093 TA and Grader: TBA

3. Course Information [contd…] Grading: Projects, Assignments, Exams –Quizs10% –Midterm 30% –Final30% –Assignments30% Assignments include –Verilog (HDL) –MIPS (Assembly Programming) –More like project

4. Course Information [contd…] Required Text –Computer Organization and Design: The Hardware/Software Interface, Third Edition, David A. Patterson and John L. Hennessy, Morgan Kaufmann Publishers Reference Information –Check the course webpage for other materials and links

5. Course Information [contd…] Course Webpage –http://ece.tamu.edu/~wshi/350.html

6. Course Overview Arithmetic Single/multicycle Datapaths Computer Arithmetic Datapaths

7. Course Overview [contd…] IFetchDcdExecMemWB IFetchDcdExecMemWB IFetchDcdExecMemWB IFetchDcdExecMemWB PipeliningMemory Systems Performance Memory

8. What’s In It For Me ? In-depth understanding of the inner-workings of modern computers, their evolution, and trade- offs present at the hardware/software boundary. –Insight into fast/slow operations that are easy/hard to implementation hardware Experience with the design process in the context of a large complex (hardware) design. –Functional Spec --> Control & Datapath --> Physical implementation –Modern CAD tools

9. Computer Architecture - Definition Computer Architecture = ISA + MO Instruction Set Architecture –What the executable can “see” as underlying hardware –Logical View Machine Organization –How the hardware implements ISA ? –Physical View

10. Computer Architecture – Changing Definition 1950s to 1960s: Computer Architecture Course: –Computer Arithmetic 1970s to mid 1980s: Computer Architecture Course: –Instruction Set Design, especially ISA appropriate for compilers 1990s: Computer Architecture Course: Design of CPU, memory system, I/O system, Multiprocessors, Networks 2000s: Computer Architecture Course: –Non Von-Neumann architectures, Reconfiguration DNA Computing, Quantum Computing ????

11. Some Examples … °Digital Alpha(v1, v3)1992-97RIP soon °HP PA-RISC(v1.1, v2.0)1986-96RIP soon °Sun SPARC(v8, v9)1987-95 °SGI MIPS(MIPS I, II, III, IV, V)1986-96 °IA-16/32 (8086,286,386, 486,1978-1999 Pentium, MMX, SSE, …) °IA-64 (Itanium)1996-now °AMD64/EMT642002-now °IBM POWER (PowerPC,…)1990-now °Many dead processor architectures live on in microcontrollers

12. The MIPS R3000 ISA (Summary) Instruction Categories –Load/Store –Computational –Jump and Branch –Floating Point coprocessor –Memory Management –Special R0 - R31 PC HI LO OP rs rt rdsafunct rs rt immediate jump target 3 Instruction Formats: all 32 bits wide

13. CPSC 321 “What” is Computer Architecture ? I/O systemInstr. Set Proc. Compiler Operating System Application Digital Design Circuit Design Instruction Set Architecture Firmware Coordination of many levels of abstraction Under a rapidly changing set of forces Design, Measurement, and Evaluation Datapath & Control Layout

14. Impact of Changing ISA Early 1990’s Apple switched instruction set architecture of the Macintosh –From Motorola 68000-based machines –To PowerPC architecture Intel 80x86 Family: many implementations of same architecture –program written in 1978 for 8086 can be run on latest Pentium chip

15. Factors Affecting ISA ??? Computer Architecture Technology Programming Languages Operating Systems History Applications Cleverness

16. ISA: Critical Interface instruction set software hardware Examples: 80x86 50,000,000 vs. MIPS 5500,000 ???

17. The Big Picture Control Datapath Memory Processor Input Output Since 1946 all computers have had 5 components!!!

18. Example Organization TI SuperSPARC tm TMS390Z50 in Sun SPARCstation20 Floating-point Unit Integer Unit Inst Cache Ref MMU Data Cache Store Buffer Bus Interface SuperSPARC L2 $ CC MBus Module MBus L64852 MBus control M-S Adapter SBus DRAM Controller SBus DMA SCSI Ethernet STDIO serial kbd mouse audio RTC Floppy SBus Cards

19. Technology Trends Processor –logic capacity: about 30% per year –clock rate: about 20% per year Memory –DRAM capacity: about 60% per year (4x every 3 years) –Memory speed: about 10% per year –Cost per bit: improves about 25% per year Disk –capacity: about 60% per year –Total use of data: 100% per 9 months! Network Bandwidth –Bandwidth increasing more than 100% per year!

20. °In ~1985 the single-chip processor (32-bit) and the single-board computer emerged °In ~2002 started having multiple processor cores on a chip (IBM POWER4) DRAM YearSize 198064 Kb 1983256 Kb 19861 Mb 19894 Mb 199216 Mb 199664 Mb 1999256 Mb 20021 Gb Microprocessor Logic Density DRAM chip capacity Technology Trends

21. Smaller feature sizes – higher speed, density ECE/CS 752; copyright J. E. Smith, 2002 (Univ. of Wisconsin)

22. Technology Trends Number of transistors doubles every 18 months (amended to 24 months) ECE/CS 752; copyright J. E. Smith, 2002 (Univ. of Wisconsin)

23. Levels of Representation High Level Language Program Assembly Language Program Machine Language Program Control Signal Specification Compiler Assembler Machine Interpretation temp = v[k]; v[k] = v[k+1]; v[k+1] = temp; lw$15,0($2) lw$16,4($2) sw$16,0($2) sw$15,4($2) 0000 1001 1100 0110 1010 1111 0101 1000 1010 1111 0101 1000 0000 1001 1100 0110 1100 0110 1010 1111 0101 1000 0000 1001 0101 1000 0000 1001 1100 0110 1010 1111 ALUOP[0:3] <= InstReg[9:11] & MASK

24. Execution Cycle Instruction Fetch Instruction Decode Operand Fetch Execute Result Store Next Instruction Obtain instruction from program storage Determine required actions and instruction size Locate and obtain operand data Compute result value or status Deposit results in storage for later use Determine successor instruction

25. The Role of Performance

26. Example of Performance Measure

27. Performance Metrics Response Time –Delay between start end end time of a task Throughput –Numbers of tasks per given time

28. Examples (Throughput/Performance) Replacing the processor with a faster version ? Adding additional processor to a system ?

29. Measuring Performance Wall-clock time –or- Total Execution Time CPU Time –User Time –System Time Try using time command on UNIX system

30. Relating the Metrics Performance = 1/Execution Time CPU Execution Time = CPU clock cycles for program x Clock cycle time CPU clock cycles = Instructions for a program x Average clock cycles per Instruction

31. Amdahl’s Law Pitfall: Expecting the improvement of one aspect of a machine to increase performance by an amount proportional to the size of improvement

32. Amhdahl’s Law [contd…] A program runs in 100 seconds on a machine, with multiply operations responsible for 80 seconds of this time. How much do I have to improve the speed of multiplication if I want my program to run five times faster ? Execution Time After improvement = (exec time affected by improvement/amount of improvement) + exec time unaffected exec time after improvement = (80 seconds / n) + (100 – 80 seconds) We want performance to be 5 times faster => 20 seconds = 80/n seconds / n + 20 seconds 0 = 80 / n !!!!

33. Amdahl’s Law [contd…] Opportunity for improvement is affected by how much time the event consumes Make the common case fast

34. Summary Computer Architecture = Instruction Set Architure + Machine Organization All computers consist of five components –Processor: (1) datapath and (2) control –(3) Memory –(4) Input devices and (5) Output devices Not all “memory” are created equally –Cache: fast (expensive) memory are placed closer to the processor –Main memory: less expensive memory--we can have more Interfaces are where the problems are - between functional units and between the computer and the outside world Need to design against constraints of performance, power, area and cost

35. Summary Performance “eye of the beholder” Seconds/program = (Instructions/Pgm)x(Clk Cycles/Instructions)x(Seconds/Clk cycles) Amdahl’s Law “Make the Common Case Faster”