文件名称:Memory_allocate_and_recover
介绍说明－－下载内容均来自于网络，请自行研究使用
存储器的分配与回收算法实现
采用最先适应法、最佳适应法、最坏适应法分配主存空间。当一个新作业要求装入主存时，必须查空闲区表，从中找出一个足够大的空闲区。若找到的空闲区大于作业需要量，这是应把它分成二部分，一部分为占用区，加一部分又成为一个空闲区。-Memory allocation and recovery algorithm
To adapt to using the first method, the best fit method, the worst fit method to allocate main memory space. When a new operational requirements into the main memory, you must check the free area table, to find a large enough free area. If you find a spare area is greater than the job requirements, this is it should be divided into two parts, one for the occupied area, plus a part of has become a free zone.
采用最先适应法、最佳适应法、最坏适应法分配主存空间。当一个新作业要求装入主存时，必须查空闲区表，从中找出一个足够大的空闲区。若找到的空闲区大于作业需要量，这是应把它分成二部分，一部分为占用区，加一部分又成为一个空闲区。-Memory allocation and recovery algorithm
To adapt to using the first method, the best fit method, the worst fit method to allocate main memory space. When a new operational requirements into the main memory, you must check the free area table, to find a large enough free area. If you find a spare area is greater than the job requirements, this is it should be divided into two parts, one for the occupied area, plus a part of has become a free zone.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
内存分配回收.txt