《西安交通大学操作系统原理课件第八章》.ppt

Chapter8 Memory Management;存储层次结构 ;8.1 Background;程序的装入和链接;Multistep Processing of a User Program;Logical vs. Physical Address Space;地址重定位;Dynamic Address Translation;Binding of Instructions and Data to Memory;Memory-Management Unit (MMU);Memory-Management Unit (MMU);内外存间的数据交换;主程序(30k);Swapping;Swapping;Schematic View of Swapping;常用的内存信息保护方法有： 1 上下界地址寄存器 2 存储键;界地址寄存器;Base and Bounds;存储键;8.2 存储器管理方式;8.2 存储器管理方式;虚拟存储管理方式：满足用户对大容量内存的需要，提高内存利用率。 请求分页管理方式 请求分段管理方式 请求段页式管理方式 ;8.2.1Contiguous Allocation;8.2.1 Contiguous Allocation;Single-partition allocation（单一分区分配）;存储保护: Relocation-register scheme used to protect user processes from each other, and from changing operating-system code and data. （基址寄存器策略用来保护用户进程（同操???系统代码和数据分开。） Relocation register contains value of smallest physical address; limit register contains range of logical addresses – each logical address must be less than the limit register. （基址寄存器包含最小物理地址的值；限长寄存器包含逻辑地址的范围，每个逻辑地址必须小于限长寄存器的值。）;Hardware Support for Relocation and Limit Registers;Fixed Partitioning;Fixed Partitioning;固定分区(大小相同);Fixed Partitioning;Fixed Partitioning;Fixed Partitioning;要求Xk大小分区;Dynamic Storage-Allocation;空闲分区的管理;可变分区分配算法;可变分区分配算法框图;Dynamic Storage-Allocation Problem;首次适应算法（First Fit）;从该空闲区中截取所需 大小，修改调整分区表;循环首次适应算法(Next Fit);最佳适应算法（Best Fit）;动态分区分配算法举例;动态重定位分区分配;Fragmentation;动态重定位分区分配;8.2.2 Paging;8.2.2 Paging;Paging Model of Logical and Physical Memory;Paging Example ;Paging;Address Translation Scheme;Paging Hardware;地址结构;Page table;Implementation of Page Table;Implementation of Page Table (Cont.);Associative Memory;Paging Hardware With TLB;Effective Access Time;Effective Access Time;基本的地址变换机构;地址变换过程;分页地址变换机构工作原理;页式地址变换举例;页式地址变换;页式地址变换;页式地址变换举例;页式地址变换举例;页式地址变换举例;页式地址变换举例;页式地址变换举例;Memory Protection;Memory Protection;Structure of the Page Table;Hierarchical Page Tables;Two-Level Table Scheme;Two-Level Table Scheme;Two-Level Table Scheme;Two-Level Paging Example;Address-Translation Scheme;Three-level Paging Scheme;Multilevel Paging an