COMP226 Lectures weeks 1-4 and 12-13

Just as a reminder, here are the topics of each of Mike's lectures. (This page is updated every so often to make sure it matches what actually happened in Mike's lectures.)

1. comp226 raison d'etre, levels of analysis, overview
2. Memory, registers, words, and 2's complement.
3. Assembly language introduction (text1.s) (data.s)
4. Assembly language introduction (text2.s)
5. All the assembly language we need to know (ISEM Ref Card)
6. Machine Language I (formats and loads) (Output from od -x text1)
   • The first column is addresses. The program starts on the third line.
7. Machine Language II (branch displacements) (Output from od -x text2)
   • The first column is addresses. The program starts on the third line.
8. More on the SPARC instruction set (jmpl, synthetics and traps)
9. Subroutines and how machine code can implement recursion
   • The naive recursive Fibonacci program (which takes 69295323 steps to calculate F(30) (compare with your practical 4 results!))
10. More on subroutines, recursion and synthetics
11. Pipelining: Introduction and the hardware description language (HDL)
12. Pipeline hazards: Structural, data and control
    • Some lecture notes taken by Kang Zhang from the pipeline lectures
13. The datapath
    • The datapath from lectures
14. The pipelined datapath
    • The datapath pipelined from lectures
15. The data path and control
    • The datapath with control, figure 5.39 from the text (almost identical to the diagram presented in lectures - this one is just smaller, and some of the buses run in different directions to get to the same destination (and it has a nice blue for control lines!)).
16. Digital logic
17. More digital logic
18. Review and exam details

Final lecture: Discussion of the exam. Several years of exams should be available from the library. In addition I've located some parts of some old exams and put them on the resources page.

mike@science.mq.edu.au 10 July 2013