求教哪位大哥帮我翻译下~~急用~~!!!

存储管理
1。存储管理概述
存储管理:是对主存储器中供用户使用的区域进行管理,管理的方式有固定分区方式、可变分区方式、页式、段式、段页式和虚拟存储管理方式。
存储器分为两类:主存储器(内存)和辅助存储器(辅存)。
存储管理讨论的是内存的管理,内存是操作系统与用户进程的运行区域,但是操作系统所占用的区域一般是永久保留的,因此内存的管理主要针对用户内存区域。
有效的存储分配机制应该在用户进程提出请求时立即为其分配相应的存储空间,而在用户不再需求时及时回收,以便其他进程使用。
2。覆盖与交换技术
覆盖技术是在早期的操作系统中用于扩充内存的方法,使用覆盖技术可以把进程地址空间中的代码和数据的大部分存放在辅存上,而仅仅在内存中保留那些当前需要执行的代码,这就要求在内存与辅存之间进行信息交换。
3。分页技术
分页技术的基本思想:将内存的空间按某个固定大小的块进行划分,这些块称为物理块。然后按同样大小将用户作业的地址空间划分为一系列等长的页面。一个经过划分的作业由若干个页面组成,每个页面可以分散的存储在不同的物理块中。为了确定某个作业的各个页面与哪些物理块对应,为每个作业引入一个称为页表的数据结构。
4。分段技术
分段技术的思想:是利用二维地址空间描述一个程序结构,根据程序的逻辑结构将其分为若干独立的段,每个段占据一个连续的存储区域,但各段之间不必连续。为了管理作业存储空间,使用一张表段记录作业的各段在内存中的起始地址和长度。
5。虚拟存储技术技术
虚拟存储技术是将内存与辅存统一起来、以有限的内存和较大的辅存获得一个逻辑上相对较大的作业地址空间的技术,这样用户在编写程序时就不再受系统实际内存容量的限制。
实现方法:在运行一道程序时,只要把程序的必需部分装入内存,而其余部分仍驻留在辅存上。当程序执行过程中需要访问不在内存的数据或代码时,由操作系统将其调入。
实现虚拟存储器应提供以下的硬件支持:
有一个容量足够大的辅存,可以容纳作业的全部地址空间。
有一个一定容量的物理内存空间。
有实现虚拟地址-实地址映象的硬件转换机构。
6。页面替换算法
页面走向:一个程序在运行过程中所访问的页面号序列称为页面走向。
页面失效率:将需要访问的页面不在内存的现象称为缺页故障或页面失效。

页面替换算法分类

最佳替换算法:从内存中淘汰那些永远不会再使用的页面。
先进先出算法:最早调入内存的页面不再被访问的可能性比新近进入内存的页面要大。
最近最久未用算法:过去某段时间内未被访问过的页面在近期也不会被访问。
近似LRU算法:为每个页面设置一个访问位。

Memory Management
1。Storage management outlined
Storage management : users of the main memory for the region, the management of the fixed area, Variable Area, page style, struts, and virtual memory management of the page.
Memory is divided into two categories : main memory (memory) and the auxiliary memory (secondary stock).
Storage management to discuss the memory management system and user memory is the process of regional operations. However, the region's share of the general operating system is a permanent, and therefore the management of main memory against memory regional users.
Storage allocation mechanism can be effective in the process user requests for immediate distribution of the storage space. and the timely recovery of the user no longer needs to use other processes.
2。Cover and Technology
Early in the coverage of technology is the operating system for memory expansion, coverage of the use of space technology can process addresses most of the code and data stored in secondary deposit. Just in memory to retain the current need for the implementation of the code, which calls for the exchange of information between memory and auxiliary survival.
3。Pagination
Pagination : The basic idea of the memory space divided by a fixed block size of these pieces as physical block. Then, on the basis of equal size and customer operations such as address space is divided into a series of pages long. After months of work by a number of pages, each page can be scattered in different physical storage bins. To determine a physical piece of work with which all pages correspond to each operation to introduce a data structure called the page table.
4。Segmentation
Segmentation is the idea : a description of the structure of two-dimensional address space. In accordance with the procedures of the logical structure will be divided into several independent of each occupy a row of the storage area. But not all of the row between. To manage storage space operations, the use of the operating record of the table in memory of the start address and length.
5。Virtual Storage Technology
Virtual memory and storage technology is secondary to keep unity. supplemented with limited memory and the larger the deposit is a relatively large operation logical address space technology This system users in the preparation process ceased to be effective memory capacity constraints.
Method : In the operation together with the procedures, as long as the procedures necessary part of the load memory, and the rest still exist on the presence in the secondary. When the process of implementing procedures need not visit the memory data or code, transferred from its operating system.
Virtual Memory should provide hardware support :
The Commission has a capacity large enough deposit can accommodate all the address space operations.
A certain physical capacity of the memory space.
Achieve the virtual address-mapping hardware real change of address.
6。Page Replacement Algorithms
Pages to the process : a process in which the operation of the sequence as its page to page.
Page failure rate : there will not need to visit the page or pages of the phenomenon known as the Page Fault failure.

Page Replacement Algorithms

Best replacement algorithm : From 1988 to eliminate those pages will never use.
Algorithm : The Application of the earliest memory pages can no longer be transferred to the possibility of a visit by memory pages larger than the new entrants.
Algorithm : In the past, most recently with a long time within a certain period of time has not yet visited pages in the near future will not be visiting.
Approximate LRU algorithm : setting up a page for each trip.
温馨提示:答案为网友推荐,仅供参考
第1个回答  2006-12-14
太少了,翻译起来没意思本回答被提问者采纳