1 / 55

Chapter 1

Chapter 1. Computer Abstractions and Technology. The Computer Revolution. §1.1 Introduction. Progress in computer technology Underpinned by Moore’s Law Makes novel applications feasible Computers in automobiles Cell phones Human genome project World Wide Web Search Engines

xanthus-church
Download Presentation

Chapter 1

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Chapter 1 Computer Abstractions and Technology

  2. The Computer Revolution §1.1 Introduction • Progress in computer technology • Underpinned by Moore’s Law • Makes novel applications feasible • Computers in automobiles • Cell phones • Human genome project • World Wide Web • Search Engines • Computers are pervasive Chapter 1 — Computer Abstractions and Technology — 2

  3. Classes of Computers • Desktop computers • General purpose, variety of software • Subject to cost/performance tradeoff • Server computers • Network based • High capacity, performance, reliability • Range from small servers to building sized • Embedded computers • Hidden as components of systems • Stringent power/performance/cost constraints Chapter 1 — Computer Abstractions and Technology — 3

  4. The Processor Market Chapter 1 — Computer Abstractions and Technology — 4

  5. CSCI-365 What is CSCI-365? Coordination of many levels (layers) of abstraction Application (ex: browser) Operating Compiler System (Mac OSX) Software Assembler Instruction Set Architecture Hardware Processor Memory I/O system Datapath & Control Digital Design Circuit Design transistors

  6. What You Will Learn • How programs are translated into the machine language • And how the hardware executes them • The hardware/software interface • What determines program performance • And how it can be improved • How hardware designers improve performance • What is parallel processing Chapter 1 — Computer Abstractions and Technology — 6

  7. Understanding Performance • Algorithm • Determines number of operations executed • Programming language, compiler, architecture • Determine number of machine instructions executed per operation • Processor and memory system • Determine how fast instructions are executed • I/O system (including OS) • Determines how fast I/O operations are executed Chapter 1 — Computer Abstractions and Technology — 7

  8. Below Your Program • Application software • Written in high-level language • System software • Compiler: translates HLL code to machine code • Operating System: service code • Handling input/output • Managing memory and storage • Scheduling tasks & sharing resources • Hardware • Processor, memory, I/O controllers §1.2 Below Your Program Chapter 1 — Computer Abstractions and Technology — 8

  9. Levels of Program Code • High-level language • Level of abstraction closer to problem domain • Provides for productivity and portability • Assembly language • Textual representation of instructions • Hardware representation • Binary digits (bits) • Encoded instructions and data Chapter 1 — Computer Abstractions and Technology — 9

  10. Components of a Computer §1.3 Under the Covers • Same components forall kinds of computer • Desktop, server,embedded • Input/output includes • User-interface devices • Display, keyboard, mouse • Storage devices • Hard disk, CD/DVD, flash • Network adapters • For communicating with other computers The BIG Picture Chapter 1 — Computer Abstractions and Technology — 10

  11. Anatomy of a Computer Output device Network cable Input device Input device Chapter 1 — Computer Abstractions and Technology — 11

  12. Anatomy of a Computer Keyboard, Mouse Computer Processor Memory (where programs, data live when running) Devices Disk(where programs, data live when not running) Input Control (“brain”) Datapath (“brawn”) Output Display, Printer

  13. Anatomy of a Mouse • Optical mouse • LED illuminates desktop • Small low-res camera • Basic image processor • Looks for x, y movement • Buttons & wheel • Supersedes roller-ball mechanical mouse Chapter 1 — Computer Abstractions and Technology — 13

  14. Through the Looking Glass • LCD screen: picture elements (pixels) • Mirrors content of frame buffer memory Chapter 1 — Computer Abstractions and Technology — 14

  15. Opening the Box Chapter 1 — Computer Abstractions and Technology — 15

  16. Inside the Processor (CPU) • Datapath: performs operations on data • Control: sequences datapath, memory, ... • Cache memory • Small fast SRAM memory for immediate access to data Chapter 1 — Computer Abstractions and Technology — 16

  17. Inside the Processor • AMD Barcelona: 4 processor cores Chapter 1 — Computer Abstractions and Technology — 17

  18. Abstractions • Abstraction helps us deal with complexity • Hide lower-level detail • Instruction set architecture (ISA) • The hardware/software interface • Application binary interface • The ISA plus system software interface • Implementation • The details underlying and interface The BIG Picture Chapter 1 — Computer Abstractions and Technology — 18

  19. A Safe Place for Data • Volatile main memory • Loses instructions and data when power off • Non-volatile secondary memory • Magnetic disk • Flash memory • Optical disk (CDROM, DVD) Chapter 1 — Computer Abstractions and Technology — 19

  20. Networks • Communication and resource sharing • Local area network (LAN): Ethernet • Within a building • Wide area network (WAN: the Internet • Wireless network: WiFi, Bluetooth Chapter 1 — Computer Abstractions and Technology — 20

  21. Technology Trends • Electronics technology continues to evolve • Increased capacity and performance • Reduced cost DRAM capacity Chapter 1 — Computer Abstractions and Technology — 21

  22. Microprocessor Complexity Gordon MooreIntel Cofounder # of transistors on an IC 2X Transistors / Chip Every 1.5 years Called “Moore’s Law” Year

  23. Memory Capacity (Single-Chip DRAM) year size (Mbit) 1980 0.0625 1983 0.25 1986 1 1989 4 1992 16 1996 64 1998 128 2000 256 2002 512 2004 1024 (1Gbit) 2006 2048 (2Gbit) Bits Year • Now 1.4X/yr, or 2X every 2 years • 8000X since 1980!

  24. Computer Technology – Dramatic Change! • Memory • DRAM capacity: 2x / 2 years (since ‘96); 64xsize improvement in last decade • Processor • Speed 2x / 1.5 years (since ‘85); [slowing!]100X performance in last decade • Disk • Capacity: 2x / 1 year (since ‘97)250Xsize in last decade

  25. Performance Metrics • Purchasing perspective • given a collection of machines, which has the • best performance ? • least cost ? • best cost/performance? • Design perspective • faced with design options, which has the • best performance improvement ? • least cost ? • best cost/performance? • Both require • basis for comparison • metric for evaluation • Our goal is to understand what factors in the architecture contribute to overall system performance and the relative importance (and cost) of these factors

  26. Defining Performance §1.4 Performance • Which airplane has the best performance? Chapter 1 — Computer Abstractions and Technology — 26

  27. Response Time and Throughput • Response time • How long it takes to do a task • Throughput • Total work done per unit time • e.g., tasks/transactions/… per hour • How are response time and throughput affected by • Replacing the processor with a faster version? • Adding more processors? • We’ll focus on response time for now… Chapter 1 — Computer Abstractions and Technology — 27

  28. Relative Performance • Define Performance = 1/Execution Time • “X is n time faster than Y” • Example: time taken to run a program • 10s on A, 15s on B • Execution TimeB / Execution TimeA= 15s / 10s = 1.5 • So A is 1.5 times faster than B Chapter 1 — Computer Abstractions and Technology — 28

  29. Measuring Execution Time • Elapsed time • Total response time, including all aspects • Processing, I/O, OS overhead, idle time • Determines system performance • CPU time • Time spent processing a given job • Discounts I/O time, other jobs’ shares • Comprises user CPU time and system CPU time • Different programs are affected differently by CPU and system performance Chapter 1 — Computer Abstractions and Technology — 29

  30. CPU Clocking • Operation of digital hardware governed by a constant-rate clock Clock period Clock (cycles) Data transferand computation Update state • Clock period: duration of a clock cycle • e.g., 250ps = 0.25ns = 250×10–12s • Clock frequency (rate): cycles per second • e.g., 4.0GHz = 4000MHz = 4.0×109Hz Chapter 1 — Computer Abstractions and Technology — 30

  31. Review: Machine Clock Rate • Clock rate (clock cycles per second in MHz or GHz) is inverse of clock cycle time (clock period) CC = 1 / CR one clock period 10 nsec clock cycle => 100 MHz clock rate 5 nsec clock cycle => 200 MHz clock rate 2 nsec clock cycle => 500 MHz clock rate 1 nsec (10-9) clock cycle => 1 GHz (109) clock rate 500 psec clock cycle => 2 GHz clock rate 250 psec clock cycle => 4 GHz clock rate 200 psec clock cycle => 5 GHz clock rate

  32. CPU Time • Performance improved by • Reducing number of clock cycles • Increasing clock rate • Hardware designer must often trade off clock rate against cycle count Chapter 1 — Computer Abstractions and Technology — 32

  33. CPU Time Example • Computer A: 2GHz clock, 10s CPU time • Designing Computer B • Aim for 6s CPU time • Can do faster clock, but causes 1.2 × clock cycles • How fast must Computer B clock be? Chapter 1 — Computer Abstractions and Technology — 33

  34. Instruction Count and CPI • Instruction Count for a program • Determined by program, ISA and compiler • Average cycles per instruction • Determined by CPU hardware • If different instructions have different CPI • Average CPI affected by instruction mix Chapter 1 — Computer Abstractions and Technology — 34

  35. CPI Example • Computer A: Cycle Time = 250ps, CPI = 2.0 • Computer B: Cycle Time = 500ps, CPI = 1.2 • Same ISA • Which is faster, and by how much? A is faster… …by this much Chapter 1 — Computer Abstractions and Technology — 35

  36. CPI in More Detail • If different instruction classes take different numbers of cycles • Weighted average CPI Relative frequency Chapter 1 — Computer Abstractions and Technology — 36

  37. CPI Example • Alternative compiled code sequences using instructions in classes A, B, C • Sequence 1: IC = 5 • Clock Cycles= 2×1 + 1×2 + 2×3= 10 • Avg. CPI = 10/5 = 2.0 • Sequence 2: IC = 6 • Clock Cycles= 4×1 + 1×2 + 1×3= 9 • Avg. CPI = 9/6 = 1.5 Chapter 1 — Computer Abstractions and Technology — 37

  38. A Simple Example • How much faster would the machine be if a better data cache reduced the average load time to 2 cycles? • How does this compare with using branch prediction to shave a cycle off the branch time? • What if two ALU instructions could be executed at once? .5 1.0 .3 .4 .5 .4 .3 .4 .5 1.0 .3 .2 .25 1.0 .3 .4 2.2 1.6 2.0 1.95 CPU time new = 1.6 x IC x CC so 2.2/1.6 means 37.5% faster CPU time new = 2.0 x IC x CC so 2.2/2.0 means 10% faster CPU time new = 1.95 x IC x CC so 2.2/1.95 means 12.8% faster

  39. Determinates of CPU Performance CPU time = Instruction_count x CPI x clock_cycle

  40. Determinates of CPU Performance CPU time = Instruction_count x CPI x clock_cycle X X X X X X X X X X X X

  41. Power Trends §1.5 The Power Wall • In CMOS IC technology ×30 ×300 Chapter 1 — Computer Abstractions and Technology — 43

  42. Reducing Power • Suppose a new CPU has • 85% of capacitive load of old CPU • 15% voltage and 15% frequency reduction • The power wall • We can’t reduce voltage further • We can’t remove more heat • How else can we improve performance? Chapter 1 — Computer Abstractions and Technology — 44

  43. Uniprocessor Performance §1.6 The Sea Change: The Switch to Multiprocessors Constrained by power, instruction-level parallelism, memory latency Chapter 1 — Computer Abstractions and Technology — 45

  44. Multiprocessors • Multicore microprocessors • More than one processor per chip • Requires explicitly parallel programming • Compare with instruction level parallelism • Hardware executes multiple instructions at once • Hidden from the programmer • Hard to do • Programming for performance • Load balancing • Optimizing communication and synchronization Chapter 1 — Computer Abstractions and Technology — 46

  45. Manufacturing ICs • Yield: proportion of working dies per wafer §1.7 Real Stuff: The AMD Opteron X4 Chapter 1 — Computer Abstractions and Technology — 47

  46. AMD Opteron X2 Wafer • X2: 300mm wafer, 117 chips, 90nm technology • X4: 45nm technology Chapter 1 — Computer Abstractions and Technology — 48

  47. Integrated Circuit Cost • Nonlinear relation to area and defect rate • Wafer cost and area are fixed • Defect rate determined by manufacturing process • Die area determined by architecture and circuit design Chapter 1 — Computer Abstractions and Technology — 49

  48. SPEC CPU Benchmark • Programs used to measure performance • Supposedly typical of actual workload • Standard Performance Evaluation Corp (SPEC) • Develops benchmarks for CPU, I/O, Web, … • SPEC CPU2006 • Elapsed time to execute a selection of programs • Negligible I/O, so focuses on CPU performance • Normalize relative to reference machine • Summarize as geometric mean of performance ratios • CINT2006 (integer) and CFP2006 (floating-point) Chapter 1 — Computer Abstractions and Technology — 50

  49. CINT2006 for Opteron X4 2356 High cache miss rates Chapter 1 — Computer Abstractions and Technology — 51

  50. SPEC Power Benchmark • Power consumption of server at different workload levels • Performance: ssj_ops/sec • Power: Watts (Joules/sec) Chapter 1 — Computer Abstractions and Technology — 52

More Related