Issues in demand paging
How to keep track of which logical page goes where in the main memory? More specifically, what are the data structures needed?
- Page table, one per logical address space.
How to translate logical address into physical address and when?
- Address translation algorithm applied every time a memory reference is needed.
How to avoid repeated translations?
- After all most programs exhibit good locality. “cache recent translations”