Download presentation
Presentation is loading. Please wait.
1
Figure 16.1 Target model of an OS
2
Figure 16.2 The MINOS memory map
3
Figure 16.3 Block diagram, MINOS
4
Figure 16.4 MINOS process dispatch
5
Figure 16.5 Two processes sharing a single program
6
Figure 16.6 A typical process control block
7
Figure 16.7 The major process states
8
Figure 16.9 Round-robin scheduling
9
Figure 16.10 Multilevel feedback
10
Figure 16.11 The use of overlays
11
Figure 16.12 Variable partitioning of memory at three different times
12
Figure 16.13 Internal and external fragmentation
13
Figure 16.14 Frames and pages
14
Figure 16.15 Composition of an address for paging
15
Figure 16.16 The page translation process
16
Figure 16.17 A Little Man page table with a large physical memory space
17
Figure 16.18 Mapping for three processes
18
Figure 16.19 Steps in handling a page fault
19
Figure (continued)
20
Figure Memory use with time, exhibiting locality Source: OPERATING SYSTEMS 2/E by Stallings, W. © Reprinted by permission of Prentice-Hall, Upper Saddle River, NJ.
21
Figure 16.21 Frame lookup procedures: (a) page in TLB, (b) page not in TLB
22
Figure (continued)
23
Figure 16.22 Internal fragmentation
24
Figure Scan scheduling algorithm Source: Copyright 1971 International Business Machines Corporation. Reprinted with permission from IBM Systems Journal, Vol. 10, No 3.
25
Figure 16. 24 Comparison of different disk algorithms. Source: A
Figure Comparison of different disk algorithms. Source: A. Silberschatz/ J. Petterson/ P. Galvin, Operating Systems Concepts, Fifth Edition. © 1998 by John Wiley and Sons, Inc. Reprinted by permission of John Wiley & Sons, Inc.
26
Figure (continued)
27
Figure 16.25 The access for a networked operating system
28
Figure 16.26 A familiar deadlock situation
29
Figure 16.27 Java virtual machine
Similar presentations
