1.实现一个内存管理的伙伴算法，实现内存块申请时的分配和释放后的回收。



实验准备

　　　用随机函数仿真进程进行内存申请，并且以较为随机的次序进行释放。对其碎片进行统计，当申请分配内存失败时区分实际空间不足和由于碎片而不能满足。



2.设计一个虚拟存储区和内存工作区，并使用下述算法计算访问命中率。

　　　1) 最佳置换算法（Optimal）

　　　2) 先进先出法（Fisrt In First Out）

　　　3) 最近最久未使用（Least Recently Used）

　　　4) 最不经常使用法（Least Frequently Used）

　　　5) 最近未使用法（No Used Recently）

　　　其中，命中率＝１－页面失效次数／页地址流长度。

　　　　试对上述算法的性能加以较各：页面个数和命中率间的关系；同样情况下的命中率比较。-1. A partner of the memory management algorithm to achieve a recovery after the application of the memory block allocation and release. Experimental preparation random function simulation process memory application, and released in a more random order. Statistics, when applications allocate memory failed to distinguish between the actual lack of space and because of the debris and can not meet its debris. Design a virtual memory storage area and workspace, access to the hit rate and use the following algorithm. 1) The best replacement algorithm (Optimal) 2) first-in, first-out method (Fisrt In First Out), 3) Recently the most-recently-used (Least Recently Used) 4) is not the most frequently used method (Least Frequently Used) 5) unused method recently (No Used Recently) which hit rate = 1- the number of page faults/page address stream length. The test of the performance of the above algorithm to be compared to the relationship between: page number and hit rate　compare the hit rate in