Scribd
Upload
852 views1 page

Computer Architecture Formulas

This document contains formulas and rules of thumb related to computer architecture performance metrics, energy usage, manufacturing yields, and memory system behavior. The formulas define CPU time, performance ratios, dynamic energy and power, static power, availability, die yield, means of execution times, average memory access time, misses per instruction, and cache index size. The rules of thumb address balanced system requirements, program locality, bandwidth growth, cache miss rates, design dependability, and the cost of power in data centers.

Uploaded by

Bradley Quadros
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
852 views1 page

Computer Architecture Formulas

This document contains formulas and rules of thumb related to computer architecture performance metrics, energy usage, manufacturing yields, and memory system behavior. The formulas define CPU time, performance ratios, dynamic energy and power, static power, availability, die yield, means of execution times, average memory access time, misses per instruction, and cache index size. The rules of thumb address balanced system requirements, program locality, bandwidth growth, cache miss rates, design dependability, and the cost of power in data centers.

Uploaded by

Bradley Quadros
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Computer Architecture Formulas

1. CPU time = Instruction count Clock cycles per instruction Clock cycle
time
2. X is n times faster than Y: n = Execution timeY/Execution timeX =
PerformanceX/PerformanceY
3.
4. Energydynamic 1/2 Capacitive load Voltage2
5. Powerdynamic 1/2 Capacitive load Voltage2 Frequency switched
6. Powerstatic Currentstatic Voltage
7. Availability = Mean Time To Fail / (Mean Time To Fail + Mean Time to
Repair)
8. Die yield = Wafer yield 1 / (1 + Defects per unit area Die area)N
where Wafer yield accounts for wafers that are so bad they need not be tested
and N is a parameter called the process-complexity factor, a measure of
manufacturing difficulty. N ranges from 11.5 to 15.5 in 2011.
9. Meansarithmetic (AM), weighted arithmetic (WAM), and geometric (GM):

where Timei is the execution time for the ith program of a total of n in the
workload, Weighti is the weighting of the ith program in the workload.
10. Average memory-access time = Hit time + Miss rate Miss penalty
11. Misses per instruction = Miss rate Memory access per instruction
12. Cache index size: 2index = Cache size/(Block size Set associativity)
13.

Rules of Thumb
1. Amdahl/Case Rule: A balanced computer system needs about 1 MB of main
memory capacity and 1 megabit per second of I/O bandwidth per MIPS of
CPU performance.
2. 90/10 Locality Rule: A program executes about 90% of its instructions in 10%
of its code.
3. Bandwidth Rule: Bandwidth grows by at least the square of the improvement
in latency.
4. 2:1 Cache Rule: The miss rate of a direct-mapped cache of size N is about the
same as a two-way set-associative cache of size N/2.
5. Dependability Rule: Design with no single point of failure.
6. Watt-Year Rule: The fully burdened cost of a Watt per year in a Warehouse
Scale Computer in North America in 2011, including the cost of amortizing
the power and cooling infrastructure, is about $2.

You might also like