Chapter 9 Virtual Memory Chapter 9 Virtual Memory

Chapter 9: Virtual Memory

Chapter 9: Virtual Memory n Background n Demand Paging n Process Creation n Page Replacement n Allocation of Frames n Thrashing n Demand Segmentation n Operating System Examples Operating System Concepts 9. 2 Silberschatz, Galvin and Gagne © 2005

Background n Virtual memory – 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 9. 3 Silberschatz, Galvin and Gagne © 2005

Virtual Memory That is Larger Than Physical Memory Operating System Concepts 9. 4 Silberschatz, Galvin and Gagne © 2005

Virtual-address Space Operating System Concepts 9. 5 Silberschatz, Galvin and Gagne © 2005

Shared Library Using Virtual Memory Operating System Concepts 9. 6 Silberschatz, Galvin and Gagne © 2005

Demand Paging n Divide process into several page 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 Operating System Concepts 9. 7 Silberschatz, Galvin and Gagne © 2005

Virtual memory operations with demand paging n Detect reference to page on disk n Recognize disk location of page n Choose free physical page l OS decision: if no free page is available, must replace a physical page n Bring page from disk into memory l OS decision: when to bring page into memory? n Above steps need hardware and software cooperation Operating System Concepts 9. 8 Silberschatz, Galvin and Gagne © 2005

Transfer of a Paged Memory to Contiguous Disk Space Page A 1 Page A 4 Page B 1 Page B 3 Operating System Concepts 9. 9 Silberschatz, Galvin and Gagne © 2005

Valid-Invalid Bit n With each page table entry a valid–invalid bit is associated (1 in-memory, 0 not-in-memory) Initially valid–invalid but is set to 0 on all entries n Example of a page table snapshot: n Frame # valid-invalid bit 1 1 0 0 0 page table n During address translation, if valid–invalid bit in page table entry is 0 page fault Operating System Concepts 9. 10 Silberschatz, Galvin and Gagne © 2005

Page Table When Some Pages Are Not in Main Memory Operating System Concepts 9. 11 Silberschatz, Galvin and Gagne © 2005

Page Fault n If there is ever a reference to a page, first reference will trap to OS page fault n OS looks at another table to decide: l Invalid reference abort. l Just not in memory => bring to memory. Get empty frame. Swap page into frame. Reset tables, validation bit = 1. Restart instruction: Least Recently Used l block move n n l auto increment/decrement location Operating System Concepts 9. 12 Silberschatz, Galvin and Gagne © 2005

Steps in Handling a Page Fault Operating System Concepts 9. 13 Silberschatz, Galvin and Gagne © 2005

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 9. 14 Silberschatz, Galvin and Gagne © 2005

Performance of Demand Paging 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 ] + swap page in + restart overhead) Operating System Concepts 9. 15 Silberschatz, Galvin and Gagne © 2005

Demand Paging Example n Memory access time = 200 nanoseconds n Average page-fault service time = 8 milliseconds n EAT = (1 – p) x 200. 10^-9 + p (8. 10^-3) = (1 – p) x 200 + p x 8, 000 = 200 + p x 7, 999, 800 (ns) n If one access out of 1, 000 causes a page fault, then n EAT = 200 ns +10^-3 *7, 999, 800 ns= 8, 199. 800 ns = 8. 199. 8 microseconds. n If no page fault, EAT = 200 ns and with page fault, EAT = 8200 mikrosecond => 40 times slower Operating System Concepts 9. 16 Silberschatz, Galvin and Gagne © 2005

Process Creation n Virtual memory allows other benefits during process creation: - Copy-on-Write - Memory-Mapped Files (later) Operating System Concepts 9. 17 Silberschatz, Galvin and Gagne © 2005

Copy-on-Write n Copy-on-Write (COW) allows both parent and child processes to initially share the same pages in memory If either process modifies a shared page, only then is the page copied n COW allows more efficient process creation as only modified pages are copied n Free pages are allocated from a pool of zeroed-out pages Operating System Concepts 9. 18 Silberschatz, Galvin and Gagne © 2005

COW(1) Operating System Concepts 9. 19 Silberschatz, Galvin and Gagne © 2005

COW (2) Operating System Concepts 9. 20 Silberschatz, Galvin and Gagne © 2005

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 Operating System Concepts 9. 21 Silberschatz, Galvin and Gagne © 2005

Need For Page Replacement Operating System Concepts 9. 22 Silberschatz, Galvin and Gagne © 2005

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. Read the desired page into the (newly) free frame. Update the page and frame tables. 4. Restart the process Operating System Concepts 9. 23 Silberschatz, Galvin and Gagne © 2005

Page Replacement Operating System Concepts 9. 24 Silberschatz, Galvin and Gagne © 2005

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 9. 25 Silberschatz, Galvin and Gagne © 2005

Graph of Page Faults Versus The Number of Frames Operating System Concepts 9. 26 Silberschatz, Galvin and Gagne © 2005

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 4 frames 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 10 page faults FIFO Replacement – Belady’s Anomaly l more frames more page faults Operating System Concepts 9. 27 Silberschatz, Galvin and Gagne © 2005

FIFO Page Replacement Operating System Concepts 9. 28 Silberschatz, Galvin and Gagne © 2005

FIFO Illustrating Belady’s Anomaly Operating System Concepts 9. 29 Silberschatz, Galvin and Gagne © 2005

Optimal Algorithm n Replace 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 9. 30 Silberschatz, Galvin and Gagne © 2005

Optimal Page Replacement h i t Operating System Concepts h i t h h i i t t 9. 31 h h i i t t h i t h h i i t t Silberschatz, Galvin and Gagne © 2005

Least Recently Used (LRU) Algorithm n Reference string: 1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5 1 5 2 3 5 4 3 4 n Counter implementation l Every page entry has a counter; every time page is referenced through this entry, copy the clock into the counter l When a page needs to be changed, look at the counters to determine which are to change Operating System Concepts 9. 32 Silberschatz, Galvin and Gagne © 2005

The LRU Policy n Replaces the page that has not been referenced for the longest time: l By the principle of locality, this should be the page least likely to be referenced in the near future. l performs nearly as well as the optimal policy. Operating System Concepts 9. 33 Silberschatz, Galvin and Gagne © 2005

LRU Page Replacement Operating System Concepts 9. 34 Silberschatz, Galvin and Gagne © 2005

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 6 pointers to be changed l No search for replacement Operating System Concepts 9. 35 Silberschatz, Galvin and Gagne © 2005

Use Of A Stack to Record The Most Recent Page References Operating System Concepts 9. 36 Silberschatz, Galvin and Gagne © 2005

LRU Approximation Algorithms n Reference bit l With each page associate a bit, initially = 0 l When page is referenced bit set to 1 l Replace the one which is 0 (if one exists). We do not know the order, however. n Second chance l Need reference bit l Clock replacement l If page to be replaced (in clock order) has reference bit = 1 then: 4 set reference bit 0 4 leave page in memory 4 replace next page (in clock order), subject to same rules Operating System Concepts 9. 37 Silberschatz, Galvin and Gagne © 2005

Second-Chance (clock) Page-Replacement Algorithm Operating System Concepts 9. 38 Silberschatz, Galvin and Gagne © 2005

Counting Algorithms n Keep a counter of the number of references that have been made to each page n LFU Algorithm: replaces page with smallest count n 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 9. 39 Silberschatz, Galvin and Gagne © 2005

Allocation of Frames n Each process needs minimum number of pages n Example: IBM 370 – 6 pages to handle SS 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 9. 40 Silberschatz, Galvin and Gagne © 2005

Fixed Allocation n Equal allocation – For example, if there are 100 frames and 5 processes, give each process 20 frames. n Proportional allocation – Allocate according to the size of process Operating System Concepts 9. 41 Silberschatz, Galvin and Gagne © 2005

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 9. 42 Silberschatz, Galvin and Gagne © 2005

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 Operating System Concepts 9. 43 Silberschatz, Galvin and Gagne © 2005

Thrashing n If a process does not have “enough” pages, the page-fault rate is very high. 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 n Thrashing a process is busy swapping pages in and out Operating System Concepts 9. 44 Silberschatz, Galvin and Gagne © 2005

Thrashing (Cont. ) Operating System Concepts 9. 45 Silberschatz, Galvin and Gagne © 2005

Demand Paging and Thrashing n n Why does demand paging work? Locality model l Process migrates from one locality to another l Localities may overlap Why does thrashing occur? size of locality > total memory size Operating System Concepts 9. 46 Silberschatz, Galvin and Gagne © 2005

Locality In A Memory-Reference Pattern Operating System Concepts 9. 47 Silberschatz, Galvin and Gagne © 2005

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 9. 48 Silberschatz, Galvin and Gagne © 2005

Working-set model Operating System Concepts 9. 49 Silberschatz, Galvin and Gagne © 2005

Keeping Track of the Working Set n Approximate with interval timer + a reference bit n Example: = 10, 000 l Timer interrupts after every 5000 time units l Keep in memory 2 bits for each page l Whenever a timer interrupts copy and sets the values of all reference bits to 0 l If one of the bits in memory = 1 page in working set n Why is this not completely accurate? n Improvement = 10 bits and interrupt every 1000 time units Operating System Concepts 9. 50 Silberschatz, Galvin and Gagne © 2005

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 9. 51 Silberschatz, Galvin and Gagne © 2005

Memory-Mapped Files n Memory-mapped file I/O allows file I/O to be treated as routine memory access by mapping a disk block to a page in memory n A file is initially read using demand paging. A page-sized portion of the file is read from the file system into a physical page. Subsequent reads/writes to/from the file are treated as ordinary memory accesses. n Simplifies file access by treating file I/O through memory rather than read() write() system calls n Also allows several processes to map the same file allowing the pages in memory to be shared Operating System Concepts 9. 52 Silberschatz, Galvin and Gagne © 2005

Memory Mapped Files Operating System Concepts 9. 53 Silberschatz, Galvin and Gagne © 2005

Memory-Mapped Files in Java import java. io. *; import java. nio. channels. *; public class Memory. Map. Read. Only { // Assume the page size is 4 KB public static final int PAGE SIZE = 4096; public static void main(String args[]) throws IOException { Random. Access. File in. File = new Random. Access. File(args[0], "r"); File. Channel in = in. File. get. Channel(); Mapped. Byte. Buffer mapped. Buffer = in. map(File. Channel. Map. Mode. READ ONLY, 0, in. size()); long num. Pages = in. size() / (long)PAGE SIZE; if (in. size() % PAGE SIZE > 0) ++num. Pages; Operating System Concepts 9. 54 Silberschatz, Galvin and Gagne © 2005

Memory-Mapped Files in Java (cont) // we will "touch" the first byte of every page int position = 0; for (long i = 0; i < num. Pages; i++) { byte item = mapped. Buffer. get(position); position += PAGE SIZE; } in. close(); in. File. close(); } } n The API for the map() method is as follows: map(mode, position, size) Operating System Concepts 9. 55 Silberschatz, Galvin and Gagne © 2005

Other Issues -- Prepaging n Prepaging l To reduce the large number of page faults that occurs at process startup l Prepage all or some of the pages a process will need, before they are referenced l But if prepaged pages are unused, I/O and memory wasted l Assume s pages are prepaged and α of the pages is used 4 Is cost of s * α save pages faults > or < than the cost of prepaging s * (1 - α) unnecessary pages? 4α Operating System Concepts near zero prepaging loses 9. 56 Silberschatz, Galvin and Gagne © 2005

Other Issues – Page Size n Page size selection must take into consideration: l fragmentation l table size l I/O overhead l locality Operating System Concepts 9. 57 Silberschatz, Galvin and Gagne © 2005

Other Issues – TLB Reach n TLB Reach - The amount of memory accessible from the TLB n TLB Reach = (TLB Size) X (Page Size) n Ideally, the working set of each process is stored in the TLB. Otherwise there is a high degree of page faults. n Increase the Page Size. This may lead to an increase in fragmentation as not all applications require a large page size n Provide Multiple Page Sizes. This allows applications that require larger page sizes the opportunity to use them without an increase in fragmentation. Operating System Concepts 9. 58 Silberschatz, Galvin and Gagne © 2005

Other Issues – Program Structure n Program structure Int[128, 128] data; l Each row is stored in one page l Program 1 for (j = 0; j <128; j++) for (i = 0; i < 128; i++) data[i, j] = 0; l 128 x 128 = 16, 384 page faults l Program 2 for (i = 0; i < 128; i++) for (j = 0; j < 128; j++) data[i, j] = 0; 128 page faults Operating System Concepts 9. 59 Silberschatz, Galvin and Gagne © 2005

Other Issues – I/O interlock n I/O Interlock – Pages must sometimes be locked into memory n Consider I/O. Pages that are used for copying a file from a device must be locked from being selected for eviction by a page replacement algorithm. Operating System Concepts 9. 60 Silberschatz, Galvin and Gagne © 2005

Reason Why Frames Used For I/O Must Be In Memory Operating System Concepts 9. 61 Silberschatz, Galvin and Gagne © 2005

Operating System Examples n Windows XP n Solaris Operating System Concepts 9. 62 Silberschatz, Galvin and Gagne © 2005

Windows XP n Uses demand paging with clustering. Clustering brings in pages surrounding the faulting page. n Processes are assigned working set minimum and working set maximum n Working set minimum is the minimum number of pages the process is guaranteed to have in memory n A process may be assigned as many pages up to its working set maximum n When the amount of free memory in the system falls below a threshold, automatic working set trimming is performed to restore the amount of free memory n Working set trimming removes pages from processes that have pages in excess of their working set minimum Operating System Concepts 9. 63 Silberschatz, Galvin and Gagne © 2005

Solaris n Maintains a list of free pages to assign faulting processes n Lotsfree – threshold parameter (amount of free memory) to begin paging n Desfree – threshold parameter to increasing paging n Minfree – threshold parameter to being swapping n Paging is performed by pageout process n Pageout scans pages using modified clock algorithm n Scanrate is the rate at which pages are scanned. This ranges from slowscan to fastscan n Pageout is called more frequently depending upon the amount of free memory available Operating System Concepts 9. 64 Silberschatz, Galvin and Gagne © 2005

Solaris 2 Page Scanner Operating System Concepts 9. 65 Silberschatz, Galvin and Gagne © 2005

End of Chapter 9