操作系统教学课件OS_09.pptVIP

Chapter 9 Virtual Memory Chapter 9: Virtual Memory Background Demand Paging Process Creation (Copy-on-Write) Page Replacement Allocation of Frames Thrashing Memory-Mapped Files Other Considerations Objectives To describe the benefits of a virtual memory system To explain the concepts of demand paging, replacement algorithms, and allocation of page frames To discuss the principle of the working-set model 9.1 Background All memory management schemes attempt to have many processes in memory at the same time to support a high degree of multiprogramming. Virtual memory – separation of user logical memory from physical memory. Virtual memory can be implemented via: Demand paging Demand segmentation Virtual Memory That is Larger Than Physical Memory So, the ability to execute a program only partially in memory is a great step forward. Programmers may now write programs not constrained by memory size. They may thus concentrate on the problem they’re solving rather than by limitations of the computing system. Moreso, many programs may be more readily(容易地) run at the same time because entire programs need not be physically in memory at the same time. Virtual Memory That is Larger Than Physical Memory (P316) Virtual-address Space (P318) Shared Library Using Virtual Memory (P318) Transfer of a Paged Memory to Contiguous Disk Space Valid-Invalid Bit With each page table entry a valid–invalid bit is associated(v ? in-memory, i ? not-in-memory) Valid bit = v ? associated page is both legal and is ‘in’ memory. Invalid bit (valid bit set to i) reference is either Invalid – not in the current process’s address space, or is valid for the process, but currently still on disk. Initially valid–invalid bit is set to i on all entries Example of a page table snapshot: During address translation, if valid–invalid bit in page table entry is , i ? page fault Page Table When Some Pages Are Not in Main Memory Page Fault Steps in Handling a Page Fault How about a Restart After a Pag