Presentation is loading. Please wait.

Presentation is loading. Please wait.

CS1104: Computer Organisation School of Computing National University of Singapore.

Similar presentations


Presentation on theme: "CS1104: Computer Organisation School of Computing National University of Singapore."— Presentation transcript:

1 CS1104: Computer Organisation School of Computing National University of Singapore

2 CS1104Benchmarking2  Definitions.  SPEC ’95.  Amdahl’s Law.  Read Chapter 4 of Patterson’s book  Sections 4.4 – 4.6.

3 CS1104Benchmarking3  Benchmarking: Choosing programs to evaluate performance.  Measure the performance of a machine using a set of programs which will hopefully emulate the workload generated by the user’s programs.  Benchmarks: programs designed to measure performance.

4 CS1104Benchmarking4 Benchmarks Actual Target Workload Full Application Benchmarks Small “Kernel” Benchmarks Microbenchmarks ProsCons representative very specific non-portable difficult to run or measure hard to identify cause portable widely used improvements useful in reality less representative easy to run, early in design cycle easy to “fool” identify peak capability and potential bottlenecks “peak” may be a long way from application performance

5 CS1104Benchmarking5 SPEC ’95 (1/4)  SPEC (System Performance Evaluation Cooperative)  Companies have agreed on a set of real program and inputs  Eighteen application benchmarks (with inputs) reflecting a technical computing workload  Eight integer  go, m88ksim, gcc, compress, li, ijpeg, perl, vortex  Ten floating-point intensive  tomcatv, swim, su2cor, hydro2d, mgrid, applu, turb3d, apsi, fppp, wave5  Must run with standard compiler flags  Eliminate special undocumented incantations that may not even generate working code for real programs  Can still be abused (Intel’s “other” bug)  Valuable indicator of performance (and compiler technology)

6 CS1104Benchmarking6 SPEC ’95 (2/4)

7 CS1104Benchmarking7 SPEC ’95 (3/4)  For a given ISA, increases in CPU performance can come from three sources: 1.Increase in clock rate 2.Improvements in processor organization that lower that CPI 3.Compiler enhancements that lower the instruction count or generate instructions with a lower average CPI (e.g., by using simpler instructions)  Next slide shows the SPECint95 and SPECfp95 measurements for a series of Intel Pentium processors and Pentium Pro processors.  Does doubling the clock rate double performance?  Can a machine with a slower clock rate have better performance?

8 CS1104Benchmarking8 SPEC ’95 (4/4)  At same clock rate, Pentium Pro is 1.4 to 1.5 times faster (for SPECint95) and 1.7 to 1.8 times faster (for SPECfp95) – improvements come from organizational enhancements (pipelining, memory system) to the Pentium Pro.  Performance increases at a slower rate than increase in clock rate – bottleneck at memory system, Amdahl’s law at play here.

9 CS1104Benchmarking9 Amdahl’s Law (1/3)  Pitfall: Expecting the improvement of one aspect of a machine to increase performance by an amount proportional to the size of the improvement.  Example:  Suppose a program runs in 100 seconds on a machine, with multiply operations responsible for 80 seconds of this time. How much do we have to improve the speed of multiplication if we want the program to run 4 times faster? 100 (total time) = 80 (for multiply) + UA (unaffected) 100/4 (new total time) = 80/Speedup (for multiply) + UA  Speedup = 80/5 = 16 (meaning multiply now takes only 5 seconds)

10 CS1104Benchmarking10 Amdahl’s Law (2/3)  Example (continued)  How about making it 5 times faster? 100 (total time) = 80 (for multiply) + UA (unaffected) 100/5 (new total time) = 80/Speedup (for multiply) + UA  Speedup = 80/0 = ??? (impossible!)  There is no way we can enhance multiply to achieve a fivefold increase in performance, if multiply accounts for only 80% of the workload.

11 CS1104Benchmarking11 Amdahl’s Law (3/3)  This concept is the Amdahl’s law. Performance is limited to the non-speedup portion of the program.  Execution time after improvement = Execution time of unaffected part + (Execution time of affected part / Speedup)  Corollary of Amdahl’s law: Make the common case fast.

12 CS1104Benchmarking12 Example 1  Suppose we enhance a machine making all floating- point instructions run five times faster. If the execution time of some benchmark before the floating-point enhancement is 12 seconds, what will the speedup be if half of the 12 seconds is spent executing floating-point instructions? Time = 6 (UA) + 6 (fl-pt) / 5 = 7.2 seconds. Speedup = 12/7.2 = 1.67

13 CS1104Benchmarking13 Example 2  We are looking for a benchmark to show off the new floating-point unit described in the previous example, and we want the overall benchmark to show a speedup of 3. One benchmark we are considering runs for 100 seconds with the old floating-point hardware. How much of the execution time would floating-point instructions have to account for in this program in order to yield our desired speedup on this benchmark? Speedup = 3 = 100 / (Time_FI / – Time_Fl) Time_FI = seconds

14 CS1104Benchmarking14 Sample Questions (1/4) 1.Which of the following is/are true for SPEC benchmarking? a)Higher SPEC number implies that the clock speed must be faster. b)SPEC number is an indication of the performance of the processor hardware only. c)SPEC benchmark is a single program used to measure and compare computer system performance. d)All of the above. e)None of the above. [Answer]

15 CS1104Benchmarking15 Sample Questions (2/4) 2.Which of the following is/are true for SPEC benchmarking? a)The SPEC benchmark consists of 18 actual client-target workload programs that every computer system should optimize for. b)The overall SPEC number of a system is affected by the quality of the compiler. c)A system that has a higher clock speed must always have a higher SPEC number. d)A system that has a lower overall CPI for SPEC benchmarks must always have a higher SPEC number. e)None of the above. [Answer]

16 CS1104Benchmarking16 Sample Questions (3/4) 3.Suppose a program runs in 8642 seconds on a machine, with “rotate” operation responsible for 4321 seconds. How much do we have to improve the speed of “rotate” operation if we want the program to run 4 times faster? a)Insufficient data to determine. b)The speed of the “rotate” operation is improved by a factor of 4. c)The speed of the “rotate” operation is improved by a factor of 8. d)It is impossible to achieve the proposed speedup. e)None of the above. [Answer]

17 CS1104Benchmarking17 Sample Questions (4/4) 4.Which of the following is true for benchmarking?  Benchmarking is a mechanism to compare the relative performance of computer systems.  Small kernel is always the best choice for benchmarking the actual performance of a computer system because it is easy to run.  Actual workload of a targeted application is always the best choice for benchmarking the performance of a future system to be designed.  All (a), (b), (c). e)None of the above. [Answer]

18 CS1104Benchmarking18 End of file


Download ppt "CS1104: Computer Organisation School of Computing National University of Singapore."

Similar presentations


Ads by Google