WSClock Algorithm (1) - Figure 3-20. Operation of the WSClock algorithm. (a) and (b) give an example of what happens when R = 1.
- Tanenbaum & Bos, Modern Operating Systems: 4th ed., Global Edition (c) 2015 Pearson Education Limited. All rights reserved.
WSClock Algorithm (2) - Figure 3-20. Operation of the WSClock algorithm. (c) and (d) give an example of R = 0.
- Tanenbaum & Bos, Modern Operating Systems: 4th ed., Global Edition (c) 2015 Pearson Education Limited. All rights reserved.
- Figure 3-21. Page replacement algorithms discussed in the text.
- Tanenbaum & Bos, Modern Operating Systems: 4th ed., Global Edition (c) 2015 Pearson Education Limited. All rights reserved.
Local versus Global Allocation Policies (1) - Figure 3-22. Local versus global page replacement. (a) Original configuration. (b) Local page replacement. (c) Global page replacement.
- Tanenbaum & Bos, Modern Operating Systems: 4th ed., Global Edition (c) 2015 Pearson Education Limited. All rights reserved.
Local versus Global Allocation Policies (2) - Figure 3-23. Page fault rate as a function of the number of page frames assigned.
- Tanenbaum & Bos, Modern Operating Systems: 4th ed., Global Edition (c) 2015 Pearson Education Limited. All rights reserved.
- Figure 3-24. (a) One address space. (b) Separate I and D spaces.
- Tanenbaum & Bos, Modern Operating Systems: 4th ed., Global Edition (c) 2015 Pearson Education Limited. All rights reserved.
Shared Pages - Figure 3-25. Two processes sharing the same program sharing its page table.
- Tanenbaum & Bos, Modern Operating Systems: 4th ed., Global Edition (c) 2015 Pearson Education Limited. All rights reserved.
Shared Libraries - Figure 3-26. A shared library being used by two processes.
- Tanenbaum & Bos, Modern Operating Systems: 4th ed., Global Edition (c) 2015 Pearson Education Limited. All rights reserved.
Chia sẻ với bạn bè của bạn: |
