Академический Документы
Профессиональный Документы
Культура Документы
Virtual Memory
Virtual Memory
Demand paging
Demand segmentation
Demand Paging
Demand Paging
Page Fault
10
Address Translation
11
2.
3.
4.
5.
6.
12
13
14
15
16
17
Page Replacement
algorithm
performance want an algorithm which will result in
minimum number of page faults
DMMMSU-MLUC Institute of Information Technology, Center of Development in I.T.
18
Page Replacement
19
20
3.
4.
21
Page Replacement
22
23
24
Example
See examples
25
Thrashing
26
Thrashing
Example
27
Thrashing Avoidance
28
Working Set
29
Working Set
if D > m Thrashing
Policy if D > m, then suspend one of the processes.
30
31
32
33
Summary
34
Summary
35
Summary
Workload issues
36
Summary
Hardware support
37
END OF LECTURE
DMMMSU-MLUC Institute of Information Technology, Center of Development in I.T.
38