Pipelining
April 3rd, 2007Today we’ll see how we can speed up our computer using pipelining. Lecture 17 slides.
Today we’ll see how we can speed up our computer using pipelining. Lecture 17 slides.
For more on instruction execution read section 5.5. For an overview of pipelining read 6.1. Coming up soon we’ll be talking about memory hierarchy, for a preview read sections 7.1 and 7.2.
Today we’ll go over the results of the quiz and then look at instruction execution. Lecture 16 slides.
Today we’ll look back over what we have covered so far in preparation for the quiz on Tuesday. I’ve collected a few slides to help us remember but I’d rather answer your questions than simply go through these. Bring questions on ANYTHING and we’ll try to make all clear. Quiz 2 review slides
Today we’ll begin to look at the datapath and how we generate the signals to control it. Finite-state machines, the basis for control, are an interesting and useful topic for many areas besides computer organization. Lecture 15 slides.
I sure hope you’ve already got one but the folks at the bookstore emailed to say the books are in!
Just a few problems from the book to prepare you for questions about performance. Problem Set 7
Today we’ll talk about how to implement storage such as registers, ROM, and RAM. Lecture 14 slides.
Changed from 29th originally estimated in the syllabus. We will review for the exam on Thursday 22 March.
In this lecture we’ll talk about measuring and understanding the performance of computer systems. Lecture 13 slides.