Comp 411 Spring 2007

Today we’ll talk about I/O devices and how the computer manages them. Lecture 23 slides.

Today we’ll look at how the operating system uses the virtual memory system to run programs. Lecture 22 slides.

We’ve seen how to make memory look fast using cache, now we’ll look at how to make memory look bigger. Lecture 21 slides.

Today we’ll look at more details of the cache. Lecture 20 slides.

Today we’ll begin to talk about using the memory hierarchy to create the illusion of a large-fast-cheap memory. Lecture 19 slides.

Today we’ll look at the difficulties that arise from trying to do more than one thing at a time. Lecture 18 slides.

Today we’ll see how we can speed up our computer using pipelining. Lecture 17 slides.

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.