CS 332 s20 — Beyond Physical Memory

Please watch the video lecture: It contains sections on

1. Introduction (0:04)
2. Announcements (0:32)
3. Main Points (0:54)
4. Demand Paging: Memory as a Cache for Disk (1:55)
5. Demand Paging (Before) (4:59)
6. Demand Paging (After) (6:20)
7. Demand Paging Questions (6:49)
8. High-Level Implementation (8:03)
9. Locating a Page on Disk (11:13)
10. Allocating a Page Frame (12:27)
11. Has Page Been Modified/Recently Used? (15:41)
12. Tracking Page Modifications (Before) (19:11)
13. Tracking Page Modifications (After) (19:28)
14. Models for File I/O (19:59)
15. Advantages of Memory-Mapped Files (22:25)
16. Implementing Memory-Mapped Files (25:48)
17. From Memory-Mapped Files to Demand Paged Memory (27:37)
18. How to Choose Which Page to Evict? (31:12)
19. LRU can Match Optimal Given Good Locality (33:22)
20. LRU can be Pessimal for Sequential Scan (34:19)
21. Approximating LRU/LFU (36:34)
22. Conclusion (40:26)

The Panopto viewer has table of contents entries for each slide (https://carleton.hosted.panopto.com/Panopto/Pages/Viewer.aspx?id=b11f91c5-1e40-44c8-be63-abca0137555f). You can access the lecture slides here.

1. Lab 4 peer review is due 9pm Monday, June 1.
2. The week 8 quiz is due 9pm Wednesday, June 3.