Today we’ll wrap up our overview of computer systems with a high-level look at how operating systems use the hardware to create the illusion of multiple programs running at once.
Slides for today.
Today we’ll wrap up our overview of computer systems with a high-level look at how operating systems use the hardware to create the illusion of multiple programs running at once.
Slides for today.
Through PS 6
Average: 81%
Median: 85%
We’ve seen how to make our memory system fast, now we’ll look at how to make it big using virtual memory.
Slides for today.
Today we’ll finish our discussion of caches by looking at some of the details.
Slides for today.
Mean: 45/65 (69%)
Median: 44/65 (68%)
Standard Deviation: 10/65 (16%)
This problem set will give you some practice with the implementation of virtual memory. This is due 23 April.
This problem set will give you some exercise thinking about caches. This is due Thursday 16 April.
Today we’ll begin talking about approaches to optimizing the memory system for our computer.
Slides for today.
Last time we learned that pipelining increases throughput and latency and we didn’t see any limits on its application. Today we’ll look at the issues that limit how much speedup we can get.
Slides for today.
Starting on next Tuesday we’ll begin a section on memory. Read 7.1-7.7.