- 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 Chapter 3, through section 3.4.
Many of the problems on the exam will be similar to
recitation problems
and the
daily questions.
Chapter 3, sections 1-4
- Terminology: data dependence, name dependence, antidependence, output dependence, control dependence
- Identifying types of dependence (e.g. quiz 8)
- Hazards: RAW, WAW, WAR, relationship to dependencies
- Compiler techniques: static scheduling and loop unrolling
- Advanced branch prediction: static prediction, prediction buffers, correlating branch predictors, tournament predictors
- Dynamic scheduling: Tomasulo's algorithm (about one third of the exam)
- reservation stations: understand how they work
- what is required to issue, execute, write result
- filling in tables like examples from class and recitation 12
countdown to exam start
countdown to exam end
Back to CS 3853 Homepage