- This will be a closed book exam.
- You may use a calculator, but you need to show the steps in solving the
problems, not just write down the answer.
- You may not use a calculator (such as a cell phone) that can access a network.
You are responsible for understanding all of assignments and material
from the textbook.
The exam will cover Appendix B.
Many of the problems on the exam will be similar to
recitation problems
and the
daily questions.
The exam will have 2 parts.
The first part counts 80% and contains easier problems.
Everyone should be able to finish Part 1.
The second part counts 20% and has 2 problems
with multiple parts. These problems may be harder.
If you cannot do the problems from
Part 1 quickly, you may not have time to finish Part 2.
Appendix B
- Cache terminology: hit, miss, hit ratio (or hit rate), miss ratio (or miss rate), miss penalty
- Memory Hierarchy: registers, cache, main memory, disk
- Access time and transfer rate
- Calculating CPI with cache misses
- Block Placement, Block Identification, Block Replacement, Write Strategy
- Cache associativity
- Block offset, index, and tag
- Write-back, write-through, write allocate, no-write allocate
- Cache performance: unified and split caches
- Cache optimization techniques
- Multilevel caches
- Virtual memory: paging only
- Virtual address, physical address, page, frame
- Address translation
- Page table, TLB
- Multilevel page tables
- Figures
B.17 and
B.25.
Back to CS 3853 Homepage