Supervision work for Comparative Architectures.
There will be four supervision in Comparative Architectures. The suprevision questions will be published as the time progresses, but in general the first three suprevisions will be on the material covered by the three sets of notes (so Part I in suprevision 1 etc). The final supervision will be there to answer any outstanding questions.
-
Exercises for the first supervision
- CST 1993 Paper 7 Question 4 (Load/store/copy bytes)
- CST 1997 Paper 7 Question 3 (Amdahl's Law)
-
Part i) Describe the following perforamce measures: MHz, MIPS, MFlops, algortihms kernels, synthetic benchmark. Give
an example where each of the measure fails to capture the percived performance.
Part ii) Give a gerenaral overview of SPEC benchmark suit. Include the description of the follownig: Int vs. FP SPEC; base, peak and rate scores; which mean is used in SPEC, why? - What is Rotating Register File? What is Register Window?
-
Exercises for the second supervision
- CST 1997 Paper 8 Question 4 (Control flow)
- CST 2001 Paper 8 Question 10 (Summing arrays)
- CST 2002 Paper 8 Question 10 (Pipelines)
- Create a scoreboard register state machine as it could be used in a simple processor.
-
Exercises for the third supervision
- CST 1999 Paper 8 Question 4 (Caches)
- CST 2003 Paper 7 Question 1 (ILP)
- CST 2004 Paper 7 Question 1 (IA-64)
- Learn and explain Tomasulo reordering algorithm.
- Create an example for cache blocking, and test in in Java.
-
Exercises for the fourth supervision
- Any unanswered questions. Send me an email telling me what you would like to do.
Last updated 30 October 2004. Mail me at the Lab.