存储器分配（国外英文资料）.doc

存储器分配（国外英文资料） Experiment (3) simulation memory allocation algorithm Experimental purpose Understand the dynamic partition allocation methods used in data structure and allocation algorithm, and further deepen the understanding of dynamic partitioning storage management approach and its implementation process. Experimental content (1) the dynamic partition allocation process for the first adaptive algorithm and the best adaptive algorithm is implemented using the C language and the process of alloc () and the recovery process free (). Among them, the free partition is managed by the free partition chain; When allocating memory, the system prioritized the low end of the free space. (2) assuming the initial state, the available memory space is 640KB and has the following sequence of requests: * job 1 applies for 130KB. * job 2 applies for 60KB. * job 3 applies for 100KB. * work 2 releases 60KB. * job 4 applies for 200KB. * work 3 releases 100KB. * release 130KB. * job 5 applies for 140KB. Homework 6 applications 60KB. * work 7 apply for 50KB. * homework 6 releases 60KB. Please respectively by using adaptive algorithm for the first time and the best adaptation algorithm blocks of memory allocation and recovery, demand shows that the free memory after each allocation and recovery partition chain. 3, think (1) using the first adaptive algorithm and the best adaptive algorithm, what are the different effects of memory allocation and recovery speed? (2) how to solve the problem of decreasing memory allocation due to fragmentation? / * Description: 1, the adaptive algorithm for the first time: increasing demand free partition chain to address the order of the links, when allocating memory, starting from the chain first sequential search, until find meet the requirements of free partition; The best adaptive algorithm: requires all free partitions to form a free partition chain in order of size from large to small; * / # include iostream. H # include stdlib. H # define Fre