1 / 32

CPE 731 Advanced Computer Architecture 4 – Quantitative Principles of Computer Design

CPE 731 Advanced Computer Architecture 4 – Quantitative Principles of Computer Design. Dr. Gheith Abandah Adapted from the slides of Prof. David Patterson, University of California, Berkeley. Outline. Quantitative Principles of Computer Design Take Advantage of Parallelism

Download Presentation

CPE 731 Advanced Computer Architecture 4 – Quantitative Principles of Computer Design

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. CPE 731 Advanced Computer Architecture 4 – Quantitative Principles of Computer Design Dr. Gheith Abandah Adapted from the slides of Prof. David Patterson, University of California, Berkeley

  2. Outline • Quantitative Principles of Computer Design • Take Advantage of Parallelism • Principle of Locality • Focus on the Common Case • Amdahl’s Law • The Processor Performance Equation • Careful, quantitative comparisons: • Define and quantify power • Define and quantify dependability • Define, quantify, and summarize relative performance • Define and quantify relative cost CPE 731, 4-Principles

  3. 1) Taking Advantage of Parallelism • Increasing throughput of server computer via multiple processors or multiple disks • Detailed HW design • Carry lookahead adders uses parallelism to speed up computing sums from linear to logarithmic in number of bits per operand • Multiple memory banks searched in parallel in set-associative caches • Pipelining: overlap instruction execution to reduce the total time to complete an instruction sequence. • Not every instruction depends on immediate predecessor  executing instructions completely/partially in parallel possible • Classic 5-stage pipeline: 1) Instruction Fetch (Ifetch), 2) Register Read (Reg), 3) Execute (ALU), 4) Data Memory Access (Dmem), 5) Register Write (Reg) CPE 731, 4-Principles

  4. Reg Reg Reg Reg Reg Reg Reg Reg Ifetch Ifetch Ifetch Ifetch DMem DMem DMem DMem ALU ALU ALU ALU Time (clock cycles) Cycle 1 Cycle 2 Cycle 3 Cycle 4 Cycle 5 Cycle 6 Cycle 7 I n s t r. O r d e r Pipelined Instruction Execution CPE 731, 4-Principles

  5. 2) The Principle of Locality • The Principle of Locality: • Program access a relatively small portion of the address space at any instant of time. • Two Different Types of Locality: • Temporal Locality (Locality in Time): If an item is referenced, it will tend to be referenced again soon (e.g., loops, reuse) • Spatial Locality (Locality in Space): If an item is referenced, items whose addresses are close by tend to be referenced soon (e.g., straight-line code, array access) • Last 30 years, HW relied on locality for memory perf. MEM P $ CPE 731, 4-Principles

  6. Levels of the Memory Hierarchy Capacity Access Time Cost Staging Xfer Unit Upper Level CPU Registers 100s Bytes 300 – 500 ps (0.3-0.5 ns) Registers prog./compiler 1-8 bytes Instr. Operands faster L1 Cache L1 and L2 Cache 10s-100s K Bytes ~1 ns - ~10 ns $1000s/ GByte cache cntl 32-64 bytes Blocks L2 Cache cache cntl 64-128 bytes Blocks Main Memory G Bytes 80ns- 200ns ~ $100/ GByte Memory OS 4K-8K bytes Pages Disk 10s T Bytes, 10 ms (10,000,000 ns) ~ $1 / GByte Disk user/operator Mbytes Files Larger Tape infinite sec-min ~$1 / GByte Tape Lower Level CPE 731, 4-Principles

  7. 3) Focus on the Common Case • Common sense guides computer design • Since its engineering, common sense is valuable • In making a design trade-off, favor the frequent case over the infrequent case • E.g., Instruction fetch and decode unit used more frequently than multiplier, so optimize it 1st • E.g., If database server has 50 disks / processor, storage dependability dominates system dependability, so optimize it 1st • Frequent case is often simpler and can be done faster than the infrequent case • E.g., overflow is rare when adding 2 numbers, so improve performance by optimizing more common case of no overflow • May slow down overflow, but overall performance improved by optimizing for the normal case • What is frequent case and how much performance improved by making case faster => Amdahl’s Law CPE 731, 4-Principles

  8. 4) Amdahl’s Law Best you could ever hope to do: CPE 731, 4-Principles

  9. Amdahl’s Law example • New CPU 10X faster • I/O bound server, so 60% time waiting for I/O • Apparently, its human nature to be attracted by 10X faster, vs. keeping in perspective its just 1.6X faster CPE 731, 4-Principles

  10. Amdahl’s Law example: Make the common case fast • Fraction = 0.1, Speedup = 10 • Fraction = 0.9, Speedup = 10 CPE 731, 4-Principles

  11. CPU time = Seconds = Instructions x Cycles x Seconds Program Program Instruction Cycle CPI 5) Processor performance equation inst count Inst Count CPI Clock Rate Program X Compiler X (X) Inst. Set. X X Organization X X Technology X Cycle time CPE 731, 4-Principles

  12. What’s a Clock Cycle? • Old days: 10 levels of gates • Today: determined by numerous time-of-flight issues + gate delays • clock propagation, wire lengths, drivers Latch or register combinational logic CPE 731, 4-Principles

  13. Outline • Quantitative Principles of Computer Design • Take Advantage of Parallelism • Principle of Locality • Focus on the Common Case • Amdahl’s Law • The Processor Performance Equation • Careful, quantitative comparisons: • Define and quantify power • Define and quantify dependability • Define, quantify, and summarize relative performance • Define and quantify relative cost CPE 731, 4-Principles

  14. Define and quantify power (1 / 2) • For CMOS chips, traditional dominant energy consumption has been in switching transistors, called dynamic power • For mobile devices, energy better metric • For a fixed task, slowing clock rate (frequency switched) reduces power, but not energy • Capacitive load a function of number of transistors connected to output and technology, which determines capacitance of wires and transistors • Dropping voltage helps both, so went from 5V to 1V • To save energy & dynamic power, most CPUs now turn off clock of inactive modules (e.g. Fl. Pt. Unit) CPE 731, 4-Principles

  15. Example of quantifying power • Suppose 15% reduction in voltage results in a 15% reduction in frequency. What is impact on dynamic power? CPE 731, 4-Principles

  16. Define and quantify power (2 / 2) • Because leakage current flows even when a transistor is off, now static power important too • Leakage current increases in processors with smaller transistor sizes • Increasing the number of transistors increases power even if they are turned off • In 2006, goal for leakage is 25% of total power consumption; high performance designs at 40% • Very low power systems even gate voltage to inactive modules to control loss due to leakage CPE 731, 4-Principles

  17. Outline • Quantitative Principles of Computer Design • Take Advantage of Parallelism • Principle of Locality • Focus on the Common Case • Amdahl’s Law • The Processor Performance Equation • Careful, quantitative comparisons: • Define and quantify power • Define and quantify dependability • Define, quantify, and summarize relative performance • Define and quantify relative cost CPE 731, 4-Principles

  18. Define and quantify dependability (1/3) • How decide when a system is operating properly? • Infrastructure providers now offer Service Level Agreements (SLA) to guarantee that their networking or power service would be dependable • Systems alternate between 2 states of service with respect to an SLA: • Service accomplishment, where the service is delivered as specified in SLA • Service interruption, where the delivered service is different from the SLA • Failure = transition from state 1 to state 2 • Restoration = transition from state 2 to state 1 CPE 731, 4-Principles

  19. Define and quantify dependability (2/3) • Module reliability = measure of continuous service accomplishment (or time to failure). 2 metrics • Mean Time To Failure (MTTF) measures Reliability • Failures In Time (FIT) = 1/MTTF, the rate of failures • Traditionally reported as failures per billion hours of operation • Mean Time To Repair (MTTR) measures Service Interruption • Mean Time Between Failures (MTBF) = MTTF+MTTR • Module availability measures service as alternate between the 2 states of accomplishment and interruption (number between 0 and 1, e.g. 0.9) • Module availability = MTTF / ( MTTF + MTTR) CPE 731, 4-Principles

  20. Example calculating reliability (3/3) • If modules have exponentially distributed lifetimes (age of module does not affect probability of failure), overall failure rate is the sum of failure rates of the modules • Calculate FIT and MTTF for 10 disks (1M hour MTTF per disk), 1 disk controller (0.5M hour MTTF), and 1 power supply (0.2M hour MTTF): CPE 731, 4-Principles

  21. Example calculating reliability (3/3) • If modules have exponentially distributed lifetimes (age of module does not affect probability of failure), overall failure rate is the sum of failure rates of the modules • Calculate FIT and MTTF for 10 disks (1M hour MTTF per disk), 1 disk controller (0.5M hour MTTF), and 1 power supply (0.2M hour MTTF): CPE 731, 4-Principles

  22. Outline • Quantitative Principles of Computer Design • Take Advantage of Parallelism • Principle of Locality • Focus on the Common Case • Amdahl’s Law • The Processor Performance Equation • Careful, quantitative comparisons: • Define and quantify power • Define and quantify dependability • Define, quantify, and summarize relative performance • Define and quantify relative cost CPE 731, 4-Principles

  23. performance(x) = 1 execution_time(x) Performance(X) Execution_time(Y) n = = Performance(Y) Execution_time(X) Definition: Performance • Performance is in units of things per sec • bigger is better • If we are primarily concerned with response time • " X is n times faster than Y" means CPE 731, 4-Principles

  24. Performance: What to measure • Usually rely on benchmarks vs. real workloads • To increase predictability, collections of benchmark applications, called benchmark suites, are popular • SPECCPU: popular desktop benchmark suite • CPU only, split between integer and floating point programs • SPECCPU2006 announced in Spring 2006 • CINT2006 has 12 integer, CFP2006 has 17 integer pgms • SPECSFS (NFS file server) and SPECWeb (WebServer) added as server benchmarks • Transaction Processing Council measures server performance and cost-performance for databases • TPC-C Complex query for Online Transaction Processing • TPC-H models ad hoc decision support • TPC-W a transactional web benchmark • TPC-App application server and web services benchmark CPE 731, 4-Principles

  25. How Summarize Suite Performance (1/5) • Arithmetic average of execution time of all pgms? • But they vary by 4X in speed, so some would be more important than others in arithmetic average • Could add a weights per program, but how pick weight? • Different companies want different weights for their products • SPECRatio: Normalize execution times to reference computer, yielding a ratio proportional to performance = time on reference computer time on computer being rated CPE 731, 4-Principles

  26. How Summarize Suite Performance (2/5) • If program SPECRatio on Computer A is 1.25 times bigger than Computer B, then • Note that when comparing 2 computers as a ratio, execution times on the reference computer drop out, so choice of reference computer is irrelevant CPE 731, 4-Principles

  27. How Summarize Suite Performance (3/5) • Since ratios, proper mean is geometric mean (SPECRatio unitless, so arithmetic mean meaningless) • Geometric mean of the ratios is the same as the ratio of the geometric means • Ratio of geometric means = Geometric mean of performance ratios  choice of reference computer is irrelevant! • These two points make geometric mean of ratios attractive to summarize performance CPE 731, 4-Principles

  28. How Summarize Suite Performance (4/5) • Does a single mean well summarize performance of programs in benchmark suite? • Can decide if mean a good predictor by characterizing variability of distribution using standard deviation • Like geometric mean, geometric standard deviation is multiplicative rather than arithmetic • Can simply take the logarithm of SPECRatios, compute the standard mean and standard deviation, and then take the exponent to convert back: CPE 731, 4-Principles

  29. How Summarize Suite Performance (5/5) • Standard deviation is more informative if know distribution has a standard form • bell-shaped normal distribution, whose data are symmetric around mean • lognormal distribution, where logarithms of data--not data itself--are normally distributed (symmetric) on a logarithmic scale • For a lognormal distribution, we expect that 68% of samples fall in range 95% of samples fall in range • Note: Excel provides functions EXP(), LN(), and STDEV() that make calculating geometric mean and multiplicative standard deviation easy CPE 731, 4-Principles

  30. Outline • Quantitative Principles of Computer Design • Take Advantage of Parallelism • Principle of Locality • Focus on the Common Case • Amdahl’s Law • The Processor Performance Equation • Careful, quantitative comparisons: • Define and quantify power • Define and quantify dependability • Define, quantify, and summarize relative performance • Define and quantify relative cost CPE 731, 4-Principles

  31. Quantify Cost (vs. Price) • Margins, learning curve, volume • Design cost (Non-recurring Engineering Costs, NRE) • dominated by engineer-years (~$200K per engineer year) • also mask costs (exceeding $1M) • Cost of die • die area • die yield (maturity of manufacturing process, redundancy features) • cost/size of wafers • die cost ~= f(die area^2) • Cost of packaging • number of pins (signal + power/ground pins) • power dissipation • Cost of testing • built-in test features • logical complexity of design CPE 731, 4-Principles

  32. Yield Enhancements and Competition CPE 731, 4-Principles

More Related