Chapter 9 Virtual Memory Operating System Concepts 8
- Slides: 52
Chapter 9: Virtual Memory Operating System Concepts – 8 th Edition, Silberschatz, Galvin and Gagne © 2009
Chapter 9: Virtual Memory n Background n Demand Paging n Page Replacement n Thrashing Operating System Concepts – 8 th Edition 9. 2 Silberschatz, Galvin and Gagne © 2009
Objectives n To describe the benefits of a virtual memory system n To explain the concepts of demand paging, page-replacement algorithms, and allocation of page frames n To discuss the thrashing problem. Operating System Concepts – 8 th Edition 9. 3 Silberschatz, Galvin and Gagne © 2009
Virtual Memory n Virtual memory is a technique that allows the execution of processes that are not completely in memory. l One major advantage of this scheme is that programs can be larger than physical memory. l Further, virtual memory abstracts main memory into an extremely large, uniform array of storage, separating logical memory as viewed by the user from physical memory. Operating System Concepts – 8 th Edition 9. 4 Silberschatz, Galvin and Gagne © 2009
Background n Virtual memory involves the separation of user logical memory from physical memory. l Only part of the program needs to be in memory for execution l Logical address space can therefore be much larger than physical address space l Allows address spaces to be shared by several processes l Allows for more efficient process creation n Virtual memory can be implemented via: l Demand paging l Demand segmentation Operating System Concepts – 8 th Edition 9. 5 Silberschatz, Galvin and Gagne © 2009
Virtual Memory That is Larger Than Physical Memory Operating System Concepts – 8 th Edition 9. 6 Silberschatz, Galvin and Gagne © 2009
Virtual-address Space Operating System Concepts – 8 th Edition 9. 7 Silberschatz, Galvin and Gagne © 2009
Shared Library Using Virtual Memory Operating System Concepts – 8 th Edition 9. 8 Silberschatz, Galvin and Gagne © 2009
Demand Paging n Bring a page into memory only when it is needed l Less I/O needed l Less memory needed l Faster response l More users n Page is needed reference to it l invalid reference abort l not-in-memory bring to memory n Lazy swapper – never swaps a page into memory unless page will be needed l Swapper that deals with pages is a pager Operating System Concepts – 8 th Edition 9. 9 Silberschatz, Galvin and Gagne © 2009
Transfer of a Paged Memory to Contiguous Disk Space Operating System Concepts – 8 th Edition 9. 10 Silberschatz, Galvin and Gagne © 2009
Valid-Invalid Bit n With each page table entry a valid–invalid bit is associated (v in-memory, i not-in-memory) Initially valid–invalid bit is set to i on all entries n Example of a page table snapshot: n Frame # valid-invalid bit v v i …. i i page table n During address translation, if valid–invalid bit in page table entry is I page fault Operating System Concepts – 8 th Edition 9. 11 Silberschatz, Galvin and Gagne © 2009
Page Table When Some Pages Are Not in Main Memory Operating System Concepts – 8 th Edition 9. 12 Silberschatz, Galvin and Gagne © 2009
Page Fault n If there is a reference to a page, first reference to that page will 1. 2. 3. 4. 5. trap to operating system: page fault Operating system looks at another table to decide: l Invalid reference abort l Just not in memory Get empty frame Swap page into frame Reset tables Set validation bit = v 6. Restart the instruction that caused the page fault Operating System Concepts – 8 th Edition 9. 13 Silberschatz, Galvin and Gagne © 2009
Steps in Handling a Page Fault Operating System Concepts – 8 th Edition 9. 14 Silberschatz, Galvin and Gagne © 2009
Virtual to Physical Address Translation (Mapping) Algorithm In The Paging Scheme n The machine uses TLB (translation look-aside buffer) in the cache and PT (page tables) in the main memory. n Given the page size (= frame size), the virtual addresses generated by the CPU which consists of: Page #, offset (p, d) and the access type(AT): Read-only(R), Read-Write(RW), or Execute-only (E), use the following algorithm: Operating System Concepts – 8 th Edition 9. 15 Silberschatz, Galvin and Gagne © 2009
IF p >= PTLR THEN trap ("Invalid page number") //* page# >= # of pages for this process *// IF p in TLB THEN IF NOT AT in protection THEN trap ("memory-protection violation") ELSE "Cache Hit" Physical add. = frame# * page(frame) size + d ENDIF ELSE IF in PT presence/absence bit (valid/invalid bit) = present (valid) THEN // * this page is currently loaded in a frame of the main memory *// IF NOT AT in protection THEN trap ("memory-protection violation") ELSE "Cache Miss" Physical add. = frame# * page(frame) size + d ENDIF ELSE // * this page is not in the main memory, it's in the disk. must be swapped in according to the paging replacement algorithm *// Trap ("page fault") ENDIF Operating System Concepts – 8 th Edition 9. 16 Silberschatz, Galvin and Gagne © 2009
Performance of Demand Paging n Demand paging can significantly affect the performance of a computer system. Let's compute the effective access time for a demand-paged memory. l For most computer systems, the memory-access time (ma) ranges from 10 to 200 nanoseconds. l As long as we have no page faults, the effective access time is equal to the memory access time. l If, however a page fault occurs, we must first read the relevant page from disk and then access the desired word. n Page Fault Rate 0 p 1. 0 l if p = 0 no page faults l if p = 1, every reference is a fault n Effective Access Time (EAT) EAT = (1 – p) x memory access+ p (page fault overhead + swap page out Operating System Concepts – 8 th Edition + swap page in + restart overhead) 9. 17 Silberschatz, Galvin and Gagne © 2009
Demand Paging Example n Memory access time = 200 nanoseconds n Average page-fault service time = 8 milliseconds n EAT = (1 – p) x 200 + p (8 milliseconds) = (1 – p ) x 200 + p x 8, 000 = 200 + p x 7, 999, 800 n If one access out of 1, 000 causes a page fault, then EAT = 8. 2 microseconds. This is a slowdown by a factor of 40!! Operating System Concepts – 8 th Edition 9. 18 Silberschatz, Galvin and Gagne © 2009
What happens if there is no free frame? n Page replacement – find some page in memory, but not really in use, swap it out l algorithm l performance – want an algorithm which will result in minimum number of page faults n Same page may be brought into memory several times Operating System Concepts – 8 th Edition 9. 19 Silberschatz, Galvin and Gagne © 2009
Page Replacement n If we increase the degree of multiprogramming we are over-allocating memory. n Prevent over-allocation of memory by modifying page- fault service routine to include page replacement Operating System Concepts – 8 th Edition 9. 20 Silberschatz, Galvin and Gagne © 2009
Page Replacement n Prevent over-allocation of memory by modifying page-fault service routine to include page replacement n Use modify (dirty) bit to reduce overhead of page transfers – only modified pages are written to disk n Page replacement completes separation between logical memory and physical memory – large virtual memory can be provided on a smaller physical memory n But if we use demand paging we must solve Two major problems: l Develop Frame-allocation algorithms, if we have multiple processes in memory, we must decide how many frames to allocate to each process. l Develop Page-replacement algorithms, When page replacement is required, we must select the frames that are to be replaced. Operating System Concepts – 8 th Edition 9. 21 Silberschatz, Galvin and Gagne © 2009
Need For Page Replacement Operating System Concepts – 8 th Edition 9. 22 Silberschatz, Galvin and Gagne © 2009
Basic Page Replacement 1. Find the location of the desired page on disk 2. Find a free frame: - If there is a free frame, use it - If there is no free frame, use a page replacement algorithm to select a victim frame 3. Bring the desired page into the (newly) free frame; update the page and frame tables 4. Restart the process Operating System Concepts – 8 th Edition 9. 23 Silberschatz, Galvin and Gagne © 2009
Page Replacement Operating System Concepts – 8 th Edition 9. 24 Silberschatz, Galvin and Gagne © 2009
Page Replacement Algorithms n Want lowest page-fault rate n Evaluate algorithm by running it on a particular string of memory references (reference string) and computing the number of page faults on that string n In all our examples, the reference string is 1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5 Operating System Concepts – 8 th Edition 9. 25 Silberschatz, Galvin and Gagne © 2009
Graph of Page Faults Versus The Number of Frames Operating System Concepts – 8 th Edition 9. 26 Silberschatz, Galvin and Gagne © 2009
FIFO Page Replacement n The simplest page-replacement algorithm is a first- in, first-out (FIFO) algorithm. n A FIFO replacement algorithm associates with each page the time when that page was brought into memory (FIFO queue). n When a page must be replaced, the oldest page is chosen. n The FIFO page-replacement algorithm is easy to understand program. However, its performance is not always good. Operating System Concepts – 8 th Edition 9. 27 Silberschatz, Galvin and Gagne © 2009
FIFO Page Replacement there are 15 faults altogether Operating System Concepts – 8 th Edition 9. 28 Silberschatz, Galvin and Gagne © 2009
First-In-First-Out (FIFO) Algorithm n Reference string: 1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5 n 3 frames (3 pages can be in memory at a time per process) n n 1 1 4 5 2 2 1 3 3 3 2 4 1 1 5 4 2 2 1 5 3 3 2 4 4 3 9 page faults 4 frames 10 page faults Belady’s Anomaly: more frames more page faults Operating System Concepts – 8 th Edition 9. 29 Silberschatz, Galvin and Gagne © 2009
FIFO Illustrating Belady’s Anomaly Operating System Concepts – 8 th Edition 9. 30 Silberschatz, Galvin and Gagne © 2009
Optimal Algorithm n An optimal page-replacement algorithm has the lowest page-fault rate of all algorithms (called OPT or MIN). It is simply this: l Replace the page that will not be used for longest period of time n 4 frames example : 1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5 1 4 2 6 page faults 3 4 5 n How do you know this? n Used for measuring how well your algorithm performs Operating System Concepts – 8 th Edition 9. 31 Silberschatz, Galvin and Gagne © 2009
Optimal Page Replacement 9 page faults Operating System Concepts – 8 th Edition 9. 32 Silberschatz, Galvin and Gagne © 2009
Least Recently Used (LRU) Algorithm n replace the page that has not been used for the longest period of time n Reference string: 1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5 1 1 5 2 2 2 3 5 5 4 4 3 3 3 n Counter implementation l Every page entry has a time-of-use field; every time page is referenced, copy the CPU clock/counter into the time-of-use field l When a page needs to be replaced, look at the time-of-use field values to determine which page should be replaced Operating System Concepts – 8 th Edition 9. 33 Silberschatz, Galvin and Gagne © 2009
LRU Page Replacement 12 page faults Operating System Concepts – 8 th Edition 9. 34 Silberschatz, Galvin and Gagne © 2009
LRU Algorithm (Cont. ) n Stack implementation – keep a stack of page numbers in a double link form: l Page referenced: 4 move it to the top 4 requires l 6 pointers to be changed No search for replacement Operating System Concepts – 8 th Edition 9. 35 Silberschatz, Galvin and Gagne © 2009
Use Of A Stack to Record The Most Recent Page References Operating System Concepts – 8 th Edition 9. 36 Silberschatz, Galvin and Gagne © 2009
Counting Algorithms n Keep a counter of the number of references that have been made to each page n The least frequently used (LFU) Algorithm: replaces page with smallest count n The most frequently used (MFU) Algorithm: based on the argument that the page with the smallest count was probably just brought in and has yet to be used Operating System Concepts – 8 th Edition 9. 37 Silberschatz, Galvin and Gagne © 2009
Allocation of Frames n How do we allocate the fixed amount of free memory among the various processes? n Each process needs minimum number of pages n Example: IBM 370 – 6 pages to handle Storage location to storage location MOVE instruction: l instruction is 6 bytes, might span 2 pages l 2 pages to handle from l 2 pages to handle to n Two major allocation schemes l fixed allocation l priority allocation Operating System Concepts – 8 th Edition 9. 38 Silberschatz, Galvin and Gagne © 2009
Fixed Allocation n The easiest way to split m frames among n processes is to give everyone an equal share, m/n frames. This scheme is called Equal allocation n For example, if there are 100 frames and 5 processes, give each process 20 frames. Operating System Concepts – 8 th Edition 9. 39 Silberschatz, Galvin and Gagne © 2009
Proportional allocation we allocate available memory to each process according to its size. Operating System Concepts – 8 th Edition 9. 40 Silberschatz, Galvin and Gagne © 2009
Priority Allocation n Use a proportional allocation scheme using priorities rather than size n If process Pi generates a page fault, l select for replacement one of its frames l select for replacement a frame from a process with lower priority number Operating System Concepts – 8 th Edition 9. 41 Silberschatz, Galvin and Gagne © 2009
Global vs. Local Allocation n Global replacement – process selects a replacement frame from the set of all frames; one process can take a frame from another n Local replacement – each process selects from only its own set of allocated frames n With a local replacement strategy, the number of frames allocated to a process does not change. n With global replacement, a process may happen to select only frames allocated to other processes, thus increasing the number of frames allocated to it (assuming that other processes do not choose its frames for replacement). n Global replacement generally results in greater system throughput and is therefore the more common method. Operating System Concepts – 8 th Edition 9. 42 Silberschatz, Galvin and Gagne © 2009
Thrashing n If a process does not have “enough” frames, the page-fault rate is very high. l If the process does not have the number of frames it needs to support pages in active use, it will quickly page-fault. l At this point, it must replace some page. l However, since all its pages are in active use, it must replace a page that will be needed again right away. l Consequently, it quickly faults again, and again, replacing pages that it must bring back in immediately. n Thrashing a process is busy swapping pages in and out, it is spending more time paging than executing. Operating System Concepts – 8 th Edition 9. 43 Silberschatz, Galvin and Gagne © 2009
Cause of thrashing n This leads to: l low CPU utilization l operating system thinks that it needs to increase the degree of multiprogramming l another process added to the system Operating System Concepts – 8 th Edition 9. 44 Silberschatz, Galvin and Gagne © 2009
Thrashing (Cont. ) Operating System Concepts – 8 th Edition 9. 45 Silberschatz, Galvin and Gagne © 2009
Demand Paging and Thrashing n n Why does demand paging work? Locality model l A process is composed of several different localities. Process migrates from one locality to another. l A locality is a set of pages that are actively used together. l Localities may overlap Why does thrashing occur? size of locality > total memory size Operating System Concepts – 8 th Edition 9. 46 Silberschatz, Galvin and Gagne © 2009
Thrashing n Working-Set Model. n Page-Fault Frequency Scheme. Operating System Concepts – 8 th Edition 9. 47 Silberschatz, Galvin and Gagne © 2009
Working-Set Model n working-set window a fixed number of page references Example: 10, 000 instruction n WSSi (working set of Process Pi) = total number of pages referenced in the most recent (varies in time) l if too small will not encompass entire locality l if too large will encompass several localities l if = will encompass entire program n D = WSSi total demand frames n if D > m Thrashing n Policy if D > m, then suspend one of the processes Operating System Concepts – 8 th Edition 9. 48 Silberschatz, Galvin and Gagne © 2009
Working-set model Operating System Concepts – 8 th Edition 9. 49 Silberschatz, Galvin and Gagne © 2009
Page-Fault Frequency Scheme n Establish “acceptable” page-fault rate l If actual rate too low, process loses frame l If actual rate too high, process gains frame Operating System Concepts – 8 th Edition 9. 50 Silberschatz, Galvin and Gagne © 2009
Conclusion n Virtual memory is commonly implemented by demand paging. n Demand paging is used to reduce the number of frames allocated to a process. n We need both page-replacement and frame-allocation algorithms. Operating System Concepts – 8 th Edition 9. 51 Silberschatz, Galvin and Gagne © 2009
End of Chapter 9 Operating System Concepts – 8 th Edition, Silberschatz, Galvin and Gagne © 2009
- Virtual memory in operating system
- Virtual memory
- Operating system concepts chapter 8 solutions
- Operating system concepts chapter 5 solutions
- Operating system concepts chapter 5 solutions
- Virtual memory
- Virtual memory in memory hierarchy consists of
- Operating system concepts, 10th edition
- Linux operating system concepts
- Operating system concepts with java
- Operating system concepts 6th edition
- Type 0 hypervisor
- Realtime operating system
- Operating system concepts 9판 한국어판
- Basic operating system concepts
- Operating system concepts 11th
- Operating system concepts essentials
- Operating system concepts essentials
- Peter baer galvin
- Basic concepts of memory
- Alpha axp page table entry
- Operating systems concepts
- Basic concepts of memory
- Spreading activation psychology
- Implicit and explicit memory
- Long term memory vs short term memory
- Internal memory and external memory
- Primary memory and secondary memory
- Logical address
- Which memory is the actual working memory?
- Eidetic memory vs iconic memory
- Symmetric shared memory architecture
- Buddy system memory
- File system in operating system
- Ufs4.0
- File system in operating system
- Requi
- Belady's anomaly example
- Virtual memory advantages
- Explain virtual memory in computer architecture
- Demand paging in virtual memory
- Virtual memory in os
- Process virtual address space
- Virtual memory os
- Virtual memory
- Virtual memory segmentation
- Virtual memory tlb
- Virtual memory os
- Virtual memory os
- Virtual memory is commonly implemented by
- Slab is one or more physically contiguous frames.
- Virtual memory os
- Process virtual address space