操作系统 虚拟内存概要1.pptVIP

* * * * UNIX and Solaris Memory Management Page Replacement Refinement of the clock policy * Kernel Memory Allocator Lazy buddy system * Linux Memory Management Page directory Page middle directory Page table * Windows Virtual Address Space * Windows Memory Management Paging Available Reserved Committed * Paging Behavior of a Program * Example Page Sizes * Segmentation(分段) May be unequal, dynamic size Simplifies handling of growing data structures Allows programs to be altered and recompiled independently Lends itself to sharing data among processes Lends itself to protection * Segment Tables Corresponding segment in main memory Each entry contains the length of the segment A bit is needed to determine if segment is already in main memory Another bit is needed to determine if the segment has been modified since it was loaded in main memory * Segment Table Entries * Address Translation in Segmentation System * Combined Paging and Segmentation Paging is transparent(透明) to the programmer Segmentation is visible to the programmer Each segment is broken into fixed-size pages * Combined Paging and Segmentation * Protection Relationship Between Segments * Fetch Policy(页面何时调入) Determines when a page should be brought into memory Demand paging only brings pages into main memory when a reference is made to a location on the page Many page faults when process first started Prepaging(预取) brings in more pages than needed More efficient to bring in pages that reside contiguously on the disk * Replacement Policy(替换策略) Which page is replaced? Page removed should be the page least likely to be referenced in the near future Most policies predict the future behavior on the basis of past behavior Thrashing(颠簸) Swapping out a piece of a process just before that piece is needed The processor spends most of its time swapping pieces rather than executing user instructions * Frame Locking Some of the frames in main memory may be locked. When a frame is locked, it may not be replaced Kern