一、设计目的

1、理解动态分区式存储管理的工作原理

2、掌握分区分配的一下三算法：首先适应算法、最佳适应算法和最坏适应算法

3、掌握动态分区分配的存储分配和存储回收的过程

二、设计要求

1、建立空闲分区表数据文件，该文件包括两个字段：空闲区的起始地址和长度；该文件有若干个记录，表示目前系统有多个空闲分区；

2、建立已分配分区表数据文件，该文件包括三个字段：已分配分区的起始地址、长度、作业名称；该文件有若干个记录，表示目前系统有多个作业；

3、程序启动时读两分区表数据文件，并在屏幕上显示内存的使用状态

3、接受用户的内存申请，格式：作业名、申请空间的大小

4、分别按照三种内存分配算法，选择一个空闲分区，分割，修改空闲分区表、填写已分配分区表；

5、接收作业结束信息，回收分配给作业的分区，必要时合并空闲分区，改写两个分区表；

6、在接受用户的内存申请时，当申请空间的大小大于目前任意一个空闲分区而小于若干个空闲分区的大小之和时，分配前进行碎片整理-1, designed to

1, dynamic partitioning storage management to understand the working principle of

2, master partition of about three algorithms: First-fit algorithm, the best-fit algorithm and the worst-fit algorithm

3, grasp the dynamic partition of storage allocation and storage process of recovery

Second, the design requirements

1, the establishment of free partition table data file, the file includes two fields: the starting address of free zones and the length　the file has a number of records, that the current system has more than idle partitions　

2, the establishment has been assigned the partition table data file, which includes three fields: the starting address of the allocated area, length, operating name　The document has a number of records, that the current system has multiple operations　

3, the program starts reading from a two partition table data file, and displayed on the screen using the state of the memory

3, accept the user s memory, applications, fo