Presentation is loading. Please wait.

Presentation is loading. Please wait.

810:142 Lecture 2: Performance Fall 2006 Chapter 4: Performance Adapted from Mary Jane Irwin at Penn State University for Computer Organization and Design,

Similar presentations


Presentation on theme: "810:142 Lecture 2: Performance Fall 2006 Chapter 4: Performance Adapted from Mary Jane Irwin at Penn State University for Computer Organization and Design,"— Presentation transcript:

1 810:142 Lecture 2: Performance Fall 2006 Chapter 4: Performance Adapted from Mary Jane Irwin at Penn State University for Computer Organization and Design, Patterson & Hennessy, © 2005

2 810:142 Lecture 2: Performance Fall 2006 When would you want to compare performance between different computers?

3 810:142 Lecture 2: Performance Fall 2006 Performance Metrics  Purchasing perspective l given a collection of machines, which has the -best performance ? -least cost ? -best cost/performance?  Design perspective l faced with design options, which has the -best performance improvement ? -least cost ? -best cost/performance?  Both require l basis for comparison l 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

4 810:142 Lecture 2: Performance Fall 2006 What ways can be used to determine perform on a desktop PC? What ways can be used to determine perform on a server?

5 810:142 Lecture 2: Performance Fall 2006 Defining (Speed) Performance  Normally interested in reducing l Response time (aka execution time) – the time between the start and the completion of a task -Important to individual users l Thus, to maximize performance, need to minimize execution time l Throughput – the total amount of work done in a given time -Important to data center managers l Decreasing response time almost always improves throughput performance X = 1 / execution_time X If X is n times faster than Y, then performance X execution_time Y = = n performance Y execution_time X

6 810:142 Lecture 2: Performance Fall 2006 Performance Factors  Want to distinguish elapsed time and the time spent on our task  CPU execution time (CPU time) – time the CPU spends working on a task l Does not include time waiting for I/O or running other programs CPU execution time # CPU clock cycles for a program for a program = x clock cycle time CPU execution time # CPU clock cycles for a program for a program clock rate =  Can improve performance by reducing either the length of the clock cycle or the number of clock cycles required for a program or

7 810:142 Lecture 2: Performance Fall 2006 CPU time l Does not include time waiting for I/O or running other programs

8 810:142 Lecture 2: Performance Fall 2006 Review: Machine Clock Rate  Clock rate (MHz, 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 clock cycle => 1 GHz 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

9 810:142 Lecture 2: Performance Fall 2006 Clock Cycles per Instruction  Not all instructions take the same amount of time to execute l One way to think about execution time is that it equals the number of instructions executed multiplied by the average time per instruction  Clock cycles per instruction (CPI) – the average number of clock cycles each instruction takes to execute l A way to compare two different implementations of the same ISA # CPU clock cycles # Instructions Average clock cycles for a program for a program per instruction = x CPI for this instruction class ABC CPI123

10 810:142 Lecture 2: Performance Fall 2006 Effective CPI  Computing the overall effective CPI is done by looking at the different types of instructions and their individual cycle counts and averaging Overall effective CPI =  (CPI i x IC i ) i = 1 n l Where IC i is the count (percentage) of the number of instructions of class i executed l CPI i is the (average) number of clock cycles per instruction for that instruction class l n is the number of instruction classes  The overall effective CPI varies by instruction mix – a measure of the dynamic frequency of instructions across one or many programs

11 810:142 Lecture 2: Performance Fall 2006 THE Performance Equation  Our basic performance equation is then CPU time = Instruction_count x CPI x clock_cycle Instruction_count x CPI clock_rate CPU time = or  These equations separate the three key factors that affect performance l Can measure the CPU execution time by running the program l The clock rate is usually given l Can measure overall instruction count by using profilers/ simulators without knowing all of the implementation details l CPI varies by instruction type and ISA implementation for which we must know the implementation details

12 810:142 Lecture 2: Performance Fall 2006 Determinates of CPU Performance CPU time = Instruction_count x CPI x clock_cycle Instruction_ count CPIclock_cycle Algorithm Programming language Compiler ISA Processor organization Technology

13 810:142 Lecture 2: Performance Fall 2006 Determinates of CPU Performance CPU time = Instruction_count x CPI x clock_cycle Instruction_ count CPIclock_cycle Algorithm Programming language Compiler ISA Processor organization Technology X XX XX XX X X X X X

14 810:142 Lecture 2: Performance Fall 2006 A Simple Example – calculate average CPI OpFreqCPI i Freq x CPI i ALU50%1 Load20%5 Store10%3 Branch20%2 Overall effective CPI  =

15 810:142 Lecture 2: Performance Fall 2006 A Simple Example OpFreqCPI i Freq x CPI i ALU50%1 Load20%5 Store10%3 Branch20%2 Overall effective CPI  =

16 810:142 Lecture 2: Performance Fall 2006 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? OpFreqCPI i Freq x CPI i ALU50%1 Load20%5 Store10%3 Branch20%2 Overall effective CPI  =

17 810:142 Lecture 2: Performance Fall 2006 A Simple Example  How much faster would the machine be if a better data cache reduced the average load time to 2 cycles? OpFreqCPI i Freq x CPI i ALU50%1 Load20%5 Store10%3 Branch20%2 Overall effective CPI  = Q

18 810:142 Lecture 2: Performance Fall 2006 A Simple Example  How much faster would the machine be if a better data cache reduced the average load time to 2 cycles? OpFreqCPI i Freq x CPI i ALU50%1 Load20%5 Store10%3 Branch20%2 Overall effective CPI  = CPU time new = 1.6 x IC x CC so 2.2/1.6 means 37.5% faster (Notice that 2.2 x IC x CC / 1.6 x IC x CC = 2.2/1.6, since the IC and CC remain unchanged by adding a bigger cache) 1.6 Q

19 810:142 Lecture 2: Performance Fall 2006 A Simple Example  How does this compare with using branch prediction to shave a cycle off the branch time? OpFreqCPI i Freq x CPI i ALU50%1 Load20%5 Store10%3 Branch20%2 Overall effective CPI  = Q

20 810:142 Lecture 2: Performance Fall 2006 A Simple Example  How does this compare with using branch prediction to shave a cycle off the branch time? OpFreqCPI i Freq x CPI i ALU50%1 Load20%5 Store10%3 Branch20%2 Overall effective CPI  = Q CPU time new = 2.0 x IC x CC so 2.2/2.0 means 10% faster

21 810:142 Lecture 2: Performance Fall 2006 A Simple Example  What if two ALU instructions could be executed at once? OpFreqCPI i Freq x CPI i ALU50%1 Load20%5 Store10%3 Branch20%2 Overall effective CPI  = Q

22 810:142 Lecture 2: Performance Fall 2006 A Simple Example  What if two ALU instructions could be executed at once? OpFreqCPI i Freq x CPI i ALU50%1 Load20%5 Store10%3 Branch20%2 Overall effective CPI  = Q CPU time new = 1.95 x IC x CC so 2.2/1.95 means 12.8% faster

23 810:142 Lecture 2: Performance Fall 2006 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? OpFreqCPI i Freq x CPI i ALU50%1 Load20%5 Store10%3 Branch20%2 Overall effective CPI  = CPU time new = 1.6 x IC x CC so 2.2/1.6 means 37.5% faster 1.6 Q Q CPU time new = 2.0 x IC x CC so 2.2/2.0 means 10% faster Q CPU time new = 1.95 x IC x CC so 2.2/1.95 means 12.8% faster

24 810:142 Lecture 2: Performance Fall 2006 Comparing and Summarizing Performance  Guiding principle in reporting performance measurements is reproducibility – list everything another experimenter would need to duplicate the experiment (version of the operating system, compiler settings, input set used, specific computer configuration (clock rate, cache sizes and speed, memory size and speed, etc.))  How do we summarize the performance for benchmark set with a single number? l The average of execution times that is directly proportional to total execution time is the arithmetic mean (AM) AM = 1/n  Time i i = 1 n l Where Time i is the execution time for the i th program of a total of n programs in the workload l A smaller mean indicates a smaller average execution time and thus improved performance

25 810:142 Lecture 2: Performance Fall 2006 SPEC CPU Benchmarks Integer benchmarksFP benchmarks gzipcompressionwupwiseQuantum chromodynamics vprFPGA place & routeswimShallow water model gccGNU C compilermgridMultigrid solver in 3D fields mcfCombinatorial optimizationappluParabolic/elliptic pde craftyChess programmesa3D graphics library parserWord processing programgalgelComputational fluid dynamics eonComputer visualizationartImage recognition (NN) perlbmkperl applicationequakeSeismic wave propagation simulation gapGroup theory interpreterfacerecFacial image recognition vortexObject oriented databaseammpComputational chemistry bzip2compressionlucasPrimality testing twolfCircuit place & routefma3dCrash simulation fem sixtrackNuclear physics accel apsiPollutant distribution

26 810:142 Lecture 2: Performance Fall 2006 Example SPEC Ratings

27 810:142 Lecture 2: Performance Fall 2006 Example SPEC CPU Ratings higher Spec ratio number indicates faster performance than a Sun Ultra 5_10 with a 300 MHz processor in this graph performance scales almost linearly with clock rate increase but this is often not the case! Why?

28 810:142 Lecture 2: Performance Fall 2006 Other Performance Metrics  Power consumption – especially in the embedded market where battery life is important (and passive cooling) l For power-limited applications, the most important metric is energy efficiency

29 810:142 Lecture 2: Performance Fall 2006 Other Performance Metrics  SPECweb99: Throughput Benchmark for Web Servers  Embedded Computer SPEC benchmarks

30 810:142 Lecture 2: Performance Fall 2006 Summary: Evaluating ISAs  Design-time metrics: l Can it be implemented, in how long, at what cost? l Can it be programmed? Ease of compilation?  Static Metrics: l How many bytes does the program occupy in memory?  Dynamic Metrics: l How many instructions are executed? How many bytes does the processor fetch to execute the program? l How many clocks are required per instruction? l How "lean" a clock is practical? Best Metric: Time to execute the program! CPI Inst. CountCycle Time depends on the instructions set, the processor organization, and compilation techniques.

31 810:142 Lecture 2: Performance Fall 2006 Next Lecture and Reminders  Next lecture l MIPS non-pipelined datapath/control path review -Reading assignment – PH, Chapter 5 -We’ll focus on sections


Download ppt "810:142 Lecture 2: Performance Fall 2006 Chapter 4: Performance Adapted from Mary Jane Irwin at Penn State University for Computer Organization and Design,"

Similar presentations


Ads by Google