Today we'll take a quick look at how a simple operating system uses the hardware to create the illusion of doing multiple things simultaneously. Slides for today.
Today we'll talk about the benefits and implementation of virtual memory. Readings for today are 5.4 and 5.5. Slides for today.
Remember your final project is due Friday in lab. You'll have the opportunity to demonstrate your work to the class but you are required to submit a one-page report and your code via Blackboard.
Our last exam will be Wednesday 30 November. It will cover everything up to and including the first part of lecture 17 with emphasis on lectures 11 through 17.
Today we'll talk about how to organize our cache for maximum effectiveness. Slides for today. Readings include 5.3 and 5.5.
We'll try to squeeze in two topics: issues that make pipelining less ideal that it might seem and memory hierarchy. Slides for today. Readings for today are in 4.6 to 4.8 and chapter 5.
Due 29 November before midnight.
Today we'll discuss ways to make our computer go faster using parallelism. Slides for today. Readings for today are 4.5 through 4.8.
Due: Wednesday 16 November before class.
In this lecture we will attempt to assemble a fairly complete implementation of the MIPS ISA in a single lecture. Slides for this lecture. Readings for this lecture are in section 4.1 to 4.4.
Next Page »