"Operating System" experiment four allocation and recycling of main memory space

Experiment Four allocation and recovery of main memory space

1.Purpose and requirements

1.1. Purpose of the experiment

In the high-level language to complete a main memory space allocation and recycling program, in order to deepen the dynamic partition allocation method and its algorithm understanding.

1.2. Experimental Requirements

Using the dynamic partition allocation storage management of continuous allocation, the design is completed by the first adaptive algorithm, the first cycle adaptive algorithm, the best adaptive algorithm and the worst-fit algorithm of 4 algorithms.

(1) * * Design a job application queue and the completion of the release sequence, to achieve the allocation and recovery of main memory. Use the partition description table.

(2) or in the process of running the program, the user specifies the application and release.

(3) Design a table of idle area to save the space of main memory at a certain moment.

The changes of the spare Area description table and the application and release status of each job are shown.

2.Experimental content

Complete the design, coding and commissioning work according to the assigned experimental project and complete the experiment report .

3.Experimental environment

You can use Visual C + + as your development environment. You can also use VB,CB or other visual environments under Windows to make it easier to take advantage of a variety of controls. Choose the experimental environment independently.

4.Reference data structure:

#include <stdio.h>

#include <conio.h>

#include <string.h>

#define MAX 24

struct partition{

Char pn[10];

int begin;

int size;

int end; ////////

char status; //////////

};

typedef struct partition part;

"Operating System" experiment four allocation and recycling of main memory space