Lecture 3: Performance, The Power Wall, and Benchmarking (CSCI 4350)

0.0(0)
studied byStudied by 0 people
GameKnowt Play
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/28

flashcard set

Earn XP

Description and Tags

Vocabulary flashcards covering key concepts from the lecture slides on performance, the power wall, and benchmarking.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

29 Terms

1
New cards

Performance

The ability of a computer system to complete work promptly; in practice appears as execution time and throughput; time is the absolute metric.

2
New cards

Execution Time

The total wall-clock time for a program to complete its task, including all overheads (disk I/O, OS activity, etc.).

3
New cards

Throughput

The rate at which work is completed (e.g., tasks per unit time); often expressed as capacity × speed or as a completion rate.

4
New cards

Elapsed Time

Elapsed time equals the real-world time from start to finish of a program, including system activity; another name for execution time.

5
New cards

CPU Time

The portion of elapsed time during which the CPU is actively executing instructions for the program (user time plus system time).

6
New cards

User CPU Time

Time the CPU spends executing the program’s own instructions.

7
New cards

System CPU Time

Time the CPU spends executing operating-system or other privileged tasks on behalf of the program.

8
New cards

N(instr) / Instruction Count

The number of instructions executed by a program (not simply the number of source lines).

9
New cards

N(cycles) / Ncyc

The total number of CPU clock cycles required to execute a program.

10
New cards

CPI (Cycles Per Instruction)

Average number of clock cycles needed to execute each instruction; depends on algorithm, compiler, architecture, and implementation.

11
New cards

IPC (Instructions Per Cycle)

The inverse of CPI; IPC = 1/CPI. Higher IPC means more instructions completed per clock cycle.

12
New cards

f_clk / Clock Frequency

The number of clock cycles per second; measured in hertz (Hz). fclk = 1 / Tclk.

13
New cards

T_clk / Clock Period

The duration of one clock cycle; the reciprocal of clock frequency: Tclk = 1 / fclk.

14
New cards

Classic CPU Performance Equation

tcpu = NI × CPI × Tclk = NI × CPI / fclk; time to execute a program depends on instruction count, CPI, and clock rate.

15
New cards

MIPS

Millions of Instructions Per Second; a performance metric often computed as MIPS = fclk(MHz) / CPI (or NI / tcpu in millions of instructions per second).

16
New cards

SPEC CPU 2017

Standardized benchmark suite from SPEC to measure CPU performance (without I/O/graphics); includes multiple sub-suites for integer and floating-point, single- and multi-threaded workloads.

17
New cards

SPECspeed Integer 2017

SPEC speed suite focusing on integer single-thread performance.

18
New cards

SPECspeed Floating-Point 2017

SPEC speed suite focusing on floating-point single-thread performance.

19
New cards

SPECrate Integer 2017

SPEC rate suite focusing on integer multi-threaded throughput.

20
New cards

SPECrate Floating-Point 2017

SPEC rate suite focusing on floating-point multi-threaded throughput.

21
New cards

SPECratio

The ratio t(Ref) / t(SUT) for a SPEC benchmark; used to compute the overall SPEC score as a geometric mean of r-scores.

22
New cards

P_active / Power Dissipation

Active power in CMOS circuits, proportional to CL × V^2 × fclk (with switching activity). Higher frequency and voltage increase power.

23
New cards

Dennard Scaling

Scaling principle where transistor features scale down with voltage to keep power density manageable; real-world limits have reduced its effectiveness.

24
New cards

DFS / Dynamic Frequency Scaling

Technique to adjust clock frequency (and voltage) on demand to save power, activating only parts of the chip as needed.

25
New cards

Power Wall

Phenomenon where increases in clock rate yield rising power and heat, limiting sustained gains in single-thread performance; drives a shift to throughput via parallelism.

26
New cards

Multicore / Throughput

Increase system throughput by adding more cores; requires parallel programming and introduces scheduling and communication overhead (Amdahl’s Law).

27
New cards

Amdahl’s Law

Speedup of a program with multiple processors is limited by the serial portion of the program; overall speedup ≤ 1 / (serialfraction + (parallelfraction / numberofprocessors)).

28
New cards

Benchmark

A set of programs used to measure and compare system performance.

29
New cards

Benchmark Suite

A collection of standardized benchmarks (e.g., SPEC) used to characterize performance across workloads and domains.