VM Lecture 2 скачать в хорошем качестве

VM Lecture 2

Lecture on second half of Chapter 9 of Silberschatz's textbook Table of Contents: 00:06 - Replacement Algorithms 01:39 - Faults v. # Frames 02:20 - FIFO Algorithm 03:13 - FIFO Example 05:56 - FIFO Example 4 Frames 07:39 - Belady's Anomaly 08:02 - Belady's Example 09:41 - Optimal Algorithm 10:36 - Optimal, Example 12:33 - LRU Algorithm 14:46 - LRU Alg., (cont.) 15:42 - Approximating LRU 17:47 - Clock Replacement 18:39 - Counting Algs. 21:04 - Page Buffering Algs 22:30 - Allocation of Frames 24:00 - Fixed Allocation 24:51 - Priority Allocation 25:11 - Global v. Local Allocation 25:54 - Non-Uniform Memory Access 26:32 - Thrashing 27:53 - Thrashing Graph 29:15 - Paging and Thrashing 30:39 - Locality Diagram 32:50 - Working Set Model 34:03 - Defining a Working Set 35:37 - Example Working Set 36:09 - Tracking Working Set 38:20 - Page-Fault Frequency 40:03 - Working Sets v. Fault Rates 40:28 - Prepaging 41:46 - Page Size 42:33 - TLB Reach 42:47 - Program Structure 46:41 - I/O Interlock