存储管理动态分区分配及回收算法（Dynamic partitioning and recovery algorithm for storage management）.docVIP

存储管理动态分区分配及回收算法（Dynamic partitioning and recovery algorithm for storage management） Storage management, dynamic partitioning and recovery (First, Fit, AlgorithmBest, Fit, Algor) First, the purpose and requirements Zone management is a widely used storage management technology. This experiment requires a structured high-level language to construct a partition descriptor, a dynamic partition allocation algorithm and a recovery algorithm simulation program, and discusses the characteristics of different allocation algorithms. Two, experimental content 1. Write: First, Fit, Algorithm First adaptation algorithm (First Fit): The table is searched from the first table of the free partition table to assign the first free area to the job, which is aimed at reducing the lookup time. To accommodate this algorithm, the free partitions in the free partition table (the free chain) are sorted by the address from low to high. The algorithm takes advantage of the low access part of the free area, resulting in many small free areas in the low address space, and retaining large free areas in the high address space. 2. Write: Best, Fit, Algorithm Best fit algorithm (Best, Fit): It finds the smallest and smallest free partitions that can meet the job requirements from all the free areas, which can make the fragments as small as possible. In order to adapt to this algorithm, the free partition in the idle partition table (free chain) should be sorted from small to large, starting from the header to find the first free partition allocation to meet the requirements. The algorithm retains large free areas, but causes many small free zones. #includestdio.h #includestdlib.h #includestring.h #define MAX_SIZE 32767 Typedef struct node / / define a partition descriptor structure { Int ID; / / number Int ADR; / / partition first address Int size; / / partition size Struct node *next; / / pointer to the next partition }Node; Node, *head1, *head2, *back1, *back2, *assign; /*head--, free area, queue