CSE 131 Lecture Notes - Lecture 13: Memory Hierarchy, Multiple Choice, Virtual Memory
Document Summary
Midterm - need a blue book and pink scantron. Very large , very fast, and non-volatile (doesn"t go away when power is off) Memory management goal: make the real world look as much like the ideal world as possible. Cache: small amount of fast expensive memory. Main memory: medium speed, medium price memory (dram) Disk: many gigabytes of slow, cheap memory. Data can also be stored on external memory. Try to predict which parts of memory space are used the most and push that as close to the cpu as possible. Without abstraction, a process have access to all memory. Memory is addressed from 0 to some limit which is the size of the medium. Move the content of memory address 1000 to register1. Provide an easier way to divide resources between processes. Provide a way to manage memory efficiently (where to place the data in the hierarchy) Single process: run a single process at a time.
