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.
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.
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.
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.
In this lecture we'll talk about how we control activities that require multiple steps. That will lead to controlling execution of instructions. Slides for today. Readings include C-8 and C-10.
Today we will discover how our computers store data. Slides for today. Readings for today are in C-7 through C-9.
Today we'll momentarily leave our discussion of hardware to talk about measuring computer performance. Slides for today. The reading for this lecture is in section 1.4.
Today we'll learn how floating point arithmetic works. Slides for today. Reading for today is section 3.5 and skim 3.6-3.8.
Next Page »