Experimental objective: familiar with and master the dynamic partition allocation of various algorithms,
Familiar with and master the dynamic partition in the partition recovery situations, and can realize the partition to merge,
Experiment content: high-level language simulation is used to implement dynamic partitioning storage management, requirements:
Partition allocation algorithm to realize adaptive algorithm for the first time, at least the best adaptation algorithm and at least one of the worst adaptation algorithm, familiar with and master all kinds of algorithm of free area organization way,
Partition of initialization, the size of the initial partitions can be input by the user, (only a free partition after initialization, the starting address 0, size is the size of the user input)
Partition the dynamic allocation of process: the size of the input by the user operation and operation, realize the partition process,
Partition recovery: user input operation, realize the partition recovery, at the same time, the partition of the merger to reflect, (note: there is no homework to give error message!)
Partition display: at any time, you can view the current situation of memory (what is the starting address, much to the size of the partition of free, or take up, can display)
Asked to consider: (1) the memory space is insufficient, should have corresponding display;
(2) the operation cannot be the same name, but can use again after deleting the name;
(3) homework space recycling job name is input, recycling corresponding space, if the job name does not exist, also should have corresponding hint,
CodePudding user response:
What did you these "homework" to do operation? What kind of data in some?CodePudding user response:
http://download.csdn.net/tag/%E5%8A%A8%E6%80%81%E5%88%86%E5%8C%BA%E5%AD%98%E5%82%A8%E7%AE%A1%E7%90%86