计算机操作系统-ch3b.ppt

* Segmentation with Paging: MULTICS Simplified version of the MULTICS TLB Existence of 2 page sizes makes actual TLB more complicated * Summary Fetch Strategies Page Replacement Optimal FIFO, Second-chance, Clock NRU, LRU, NFU, Aging Working Set, WSClock Design Issues for paging systems Implementation Issues Segmentation * Homework 3、4、5、11、12、13、22、24、26、28、29 * 加载页面时经常用预先调页的方式，因为一个允许被调入系统的新的作业，一开始应给予一组页框，装入相应的一组页面 * * * * * * * * Fluctuate-变动, 波动, 涨落, 上下, 动摇 vt.使动摇, 使波动, 使起伏 accommodate [ E5kCmEdeit ] vt.供应, 供给, 使适应, 调节, 和解, 向...提供, 容纳, 调和 vi.适应 * Fluctuate-变动, 波动, 涨落, 上下, 动摇 vt.使动摇, 使波动, 使起伏 accommodate [ E5kCmEdeit ] vt.供应, 供给, 使适应, 调节, 和解, 向...提供, 容纳, 调和 vi.适应 * Fluctuate-变动, 波动, 涨落, 上下, 动摇 vt.使动摇, 使波动, 使起伏 accommodate [ E5kCmEdeit ] vt.供应, 供给, 使适应, 调节, 和解, 向...提供, 容纳, 调和 vi.适应 * SEG1out ,seg7 in * Fluctuate-变动, 波动, 涨落, 上下, 动摇 vt.使动摇, 使波动, 使起伏 accommodate [ E5kCmEdeit ] vt.供应, 供给, 使适应, 调节, 和解, 向...提供, 容纳, 调和 vi.适应 * The WSClock Page Replacement Algorithm Operation of the WSClock algorithm. (c) and (d) give an example of R = 0. * Review of Page Replacement Algorithms * Design Issues for Paging SystemsLocal versus Global Allocation Policies (1) Original configuration Local page replacement Global page replacement * Load Control Despite good designs, system may still thrash Some processes need more memory but no processes need less Solution :Reduce a number of processes competing for memory swap one or more to disk, divide up pages they held reconsider degree of multiprogramming * Page Size (1) Small page size Advantages less internal fragmentation less unused program in memory Disadvantages programs need many pages, larger page tables * Page Size (2) Overhead due to page table and internal fragmentation Where s = average process size in bytes p = page size in bytes e = page entry size in bytes page table space internal fragmentation Optimized when S=1MB, e=8, p=4KB * Separate Instruction and Data Spaces One address space Separate I and D spaces