存储器分配（Memory allocation）.docVIP

存储器分配（Memory allocation） Experiment (three) simulated memory allocation algorithm 1, the purpose of the experiment Understanding the data structure and allocation algorithm used in the dynamic partitioning method, and further understanding of the dynamic partition storage management and its implementation process. 2, experimental content (1) the dynamic partition allocation process (alloc ()) and the recovery process free (C) are implemented by using the first language adaptation algorithm and the best adaptation algorithm respectively. The free partitions are managed by the free partition chain; when the memory allocation is carried out, the system uses the free space at the end of the free zone first. (2) assuming the initial state, the available memory space is 640KB and has the following sequence of requests: * homework 1, apply for 130KB. * homework 2, apply for 60KB. * homework 3, apply for 100KB. * homework 2 release 60KB. * homework 4, apply for 200KB. * homework 3 release 100KB. * homework 1 release 130KB. * homework 5, apply for 140KB. * homework 6, apply for 60KB. * homework 7, apply for 50KB. * homework 6 release 60KB. The allocation and recovery of memory blocks should be carried out by using the first adaptation algorithm and the best adaptation algorithm respectively, and the partition chain of idle memory is required after each allocation and recovery. 3, thinking (1) whats the difference between memory allocation and recovery speed by using the first adaptation algorithm and the best adaptation algorithm? (2) how to solve the problem of memory allocation speed reduction caused by fragmentation? * Explain： 1, the first adaptation algorithm: requires the idle partition chain to address the increase in the order of the link, in the allocation of memory, from the beginning of the chain of order in order to find the required to meet the idle partition so far; 2, the best adaptation algorithm: requires all idle partitions to form an idle partition chain i