CS 25000 Lecture Notes - Lecture 17: Computer Performance, Speedup

• School: Purdue University
• Department: Computer Sciences
• Course: CS 25000
• Professor: Adams George

Document Summary

The faster one runs in less time: response time, data center manager the faster one completes more jobs or queries per unit time, throughput. Execution time: wall-clock time, response time, or elapsed time: the latency to complete a task including disk accesses, memory accesses, i/o activities, o/s overhead everything. Speedup: amdahl"s law gives overall speedup accruing from an enhancement, which depends on two factores, the fraction of the original computation time that the original system can take advantage of the enhancement. Fe = fractionenhanced < 1: the improvement achieved by the enhanced mode, that is, how much faster is the enhanced mode than the original mode. = 1 / (1-fe) + (fe / se: the processor performance equation, cpu time. = (instructions/program) x (clock cycles/instruction) x (seconds/clock cycle)