Part 1 of 7 · 1 min read
Why this page comes ninth
In this module you will
- Share a number of frames among processes by the equal and the proportional method.
- Tell global replacement from local replacement, and name one strength of each.
- Explain thrashing, and read a table that shows CPU use falling as more processes run.
- Compute the working set of a process for a window size, and use the sum of working sets to decide how many processes may run.
- Describe the page-fault frequency method, and name the Linux tools that show memory pressure.
Page 8 chose a victim among the frames of one process, as if the process had memory to itself. Real machines run many processes, and the frames are shared. This page asks how many frames each process should have, and shows what goes wrong when the answer is "too few". It closes Level 6. Level 7 then looks at memory in practice, such as the allocators and the tools that watch a running system. The sources are OSTEP chapter 22, OSC chapter 10 and MOS chapter 3. The tables of the simulation on this page come from a short Python script written for this page, and the numbers in it are made up to show the idea.
About this example About this example
Real: The facts, definitions and algorithms on this page come from the books named in the text. No program on this page was timed.
Scripted: Numbers marked "made up to show the idea" were chosen for the examples.
Not real: The page simplifies real systems. Actual kernels add more cases, limits and tuning than a short page can show.