北交大操作系统作业内存管理器实验

1、实验三 内存管理1一实验目的1二实验内容1三实验设计1四模拟实验2First.cpp3First.h5Next.cpp7Next.h9五实验结果12六实验总结15实验三 内存管理一实验目的构造一个没有虚存功能的内存管理系统，并进行测试和对不同分配策略的性能展开比较评估。本次实验，选择的分配策略：First-fit 和 next-fit二实验内容1、设计一个内存管理器，支持至少两种分配策略（本实验使用firstfit策略和nextfit策略）；2、分别对不同的策略进行性能评估三实验设计1.内存unsigned char mm65536;2. 用户接口用户接口函数：int mm_init() /初

2、始化int mm_request(int n) /申请空间void mm_release(int p) /释放空间3计算请求尺寸srand(unsigned char)time(NULL);tmp = (rand() % 1024) + 1; /最大申请10244.选择待释放的块tmp = (rand() % j);while(ptmp = -1)tmp = rand() % j;requestsize = requestsize - BinToInt(&mmptmp + 4);mm_release(ptmp);cout << "释放指针 " <&

3、lt; ptmp << endl;ptmp = -1;四模拟实验实现两个版本的内存管理器，分配策略分别为：first-fit和next-fitFirst.cpp#include <iostream>#include <stdio.h>#include <windows.h>#include <time.h>#include "first.h"using namespace std;int main()int i;int j = 0; /分配指针数int p1000; /用于存放分配出的指针int tmp;int r

4、equestsize = 0; /统计申请空间int k = 0; /统计搜索步数srand(unsigned char)time(NULL);step = 0;mm_init();for(i = 0; i < 30; i+) /模拟30步cout << "第 " << i + 1 << " 步" << endl;dotmp = (rand() % 1024) + 1; /最大申请1024cout << "申请空间 " << tmp << &qu

5、ot; 字节" << endl;pj = mm_request(tmp);if(pj != -1)requestsize = requestsize+tmp;k = k + step;cout << "分配指针 " << pj << endl;cout << endl;j+;elsecout << "剩余空间不足，分配失败" << endl;while(pj != -1);tmp = (rand() % j);while(ptmp = -1)tmp = rand

6、() % j;requestsize = requestsize - BinToInt(&mmptmp + 4);mm_release(ptmp);cout << "释放指针 " << ptmp << endl;ptmp = -1;/以下为性能统计指标cout << endl;cout << "平均申请空间：" << (double)requestsize / (double)j << " 字节" << endl;cout <

7、< "平均空间利用率：" << (double)requestsize/(double)65536 << endl;cout << "平均搜索步数：" << (double)k/(double)j << endl;cout << endl;if(i + 1) % 5 = 0)system("pause");First.hunsigned char mm65536;int step; /记录搜索步数int BinToInt(unsigned char *s)

8、/把char类型变成intint i;char tmp4;int t;for(i = 0; i < 4; i+)tmp3 - i = si;memcpy(&t,tmp,4);return t;void IntToBin(int s, unsigned char *t) /把int类型变成charint i;char tmp4;memcpy(tmp,&s,4);for(i = 0; i < 4; i+)ti = tmp3 - i;int mm_init()memset(mm, 0, 65536);IntToBin(-1, mm); /前向指针 置-1 放在数组的第一个

9、位置IntToBin(65536, &mm4); /整个块大小，放在第四个位置IntToBin(-1, &mm65536-4); /后向指针 置-1 放在数组的倒数第四个位置return 0;int mm_request(int n)/四字节前向指针、四字节块大小、一字节状态、N字节可用内存、四字节后向指针int pointer = 0;step = 0;while(mmpointer+8=1)|(n+26)>=BinToInt(&mmpointer+4) /pointer+4 表示块大小/mmpointer+8=1 状态位是一，说明这一块已经被分配/n+26 申

10、请的空间+管理开销pointer=BinToInt(&mmpointer+BinToInt(&mmpointer+4)-4); /找到后向指针if(mmpointer+8 != 1)step+;/非空闲块不在链内，不计步数if(pointer = -1)return -1;mmpointer + 8 = 1; /修改本块标志位IntToBin(pointer + 4 + 4 + 1 + n + 4, &mmpointer + 9 + n); /修改本块后向指针IntToBin(pointer, &mmpointer + 4 + 4 + 1 + n + 4); /

11、修改后块前向指针IntToBin(BinToInt(&mmpointer + 4) - n - 13, &mmpointer + 4 + 4 + 1 + n + 4 + 4); /修改后块大小IntToBin(n + 13,&mmpointer + 4); /修改本块大小return pointer;void mm_release(int p)int pre;int bac;pre = BinToInt(&mmp);bac = BinToInt(&mmp + BinToInt(&mmp + 4) - 4);mmp + 8 = 0; /修改本块标志

12、位if(BinToInt(&mmbac+8) = 0) /如果后块未使用IntToBin(0,&mmp+BinToInt(&mmp + 4) - 4); /清空本块后向指针IntToBin(0,&mmbac); /清空后块前向指针IntToBin(BinToInt(&mmp + 4) + BinToInt(&mmbac + 4), &mmp + 4); /修改本块大小if(BinToInt(&mmbac + BinToInt(&mmbac + 4) - 4) != -1) /如果后块不是最后一块IntToBin(p, &a

13、mp;mmBinToInt(&mmbac + BinToInt(&mmbac + 4) - 4); /修改后块的后块前向指针IntToBin(0, &mmbac + 4); /清空后块大小if(pre = -1)return;if(BinToInt(&mmpre + 8) = 0) /如果前块未使用IntToBin(0, &mmpre + BinToInt(&mmpre + 4) - 4); /清空前块后向指针IntToBin(BinToInt(&mmpre + 4) + BinToInt(&mmp + 4), &mmpr

14、e + 4); /修改前块大小IntToBin(pre, &mmBinToInt(&mmp + BinToInt(&mmp + 4) - 4); /修改后块前向指针IntToBin(0, &mmp + 4); /清空本块大小IntToBin(0, &mmp); /清空本块前向指针Next.cpp#include <iostream>#include <stdio.h>#include <windows.h>#include <time.h>#include "next.h"using n

15、amespace std;int main()int i;int j = 0; /分配指针数int p1000; /用于存放分配出的指针int tmp;int requestsize = 0; /统计申请空间int k = 0; /统计搜索步数srand(unsigned char)time(NULL);step = 0;next = 0;end = -1;mm_init();for(i = 0; i < 30; i+)/模拟30步cout << "这是第 " << i + 1 << " 步" <<

16、endl;dotmp = (rand() % 1024) + 1; /最大申请1024cout << "申请空间 " << tmp << " 字节" << endl;pj = mm_request(tmp);if(pj != -1)requestsize = requestsize + tmp;k = k + step;cout << "分配指针：" << pj << endl;cout << endl;j+;elsecout <&l

17、t; "剩余空间不足，分配失败。" << endl;while(pj != -1);tmp = (rand() % j);while(ptmp = -1)tmp = rand() % j;requestsize = requestsize - BinToInt(&mmptmp + 4);mm_release(ptmp);cout << "释放指针：" << ptmp << endl;ptmp = -1;/以下为性能统计指标cout << endl;cout << "

18、平均申请空间：" << (double)requestsize/(double)j << " 字节" << endl;cout << "平均空间利用率：" << (double)requestsize/(double)65536 << endl;cout << "平均搜索步数：" << (double)k/(double)j << endl;cout << endl;if(i + 1) % 5 = 0)sy

19、stem("pause");Next.hunsigned char mm65536;int step;int next;int end;int BinToInt(unsigned char *s)int i;char tmp4;int t;for(i = 0; i < 4; i+)tmp3 - i = si;memcpy(&t,tmp,4);return t;void IntToBin(int s, unsigned char *t)int i;char tmp4;memcpy(tmp,&s,4);for(i = 0; i < 4; i+)ti

20、= tmp3 - i;int mm_init()memset(mm, 0, 65536);IntToBin(-1, mm);IntToBin(65536, &mm4);IntToBin(-1, &mm65536-4);return 0;int mm_request(int n)/四字节前向指针、四字节块大小、一字节状态、N字节可用内存、四字节后向指针int pointer;step = 0;pointer = next;while(pointer != -1)if(mmpointer + 8 != 1) && (n + 26) < BinToInt(&am

21、p;mmpointer + 4)break;pointer = BinToInt(&mmpointer + BinToInt(&mmpointer + 4) - 4);/step+;if(mmpointer + 8 != 1)step+;if(pointer = -1)pointer = 0;while(pointer != end)if(mmpointer + 8 != 1) && (n + 26) < BinToInt(&mmpointer + 4)break;pointer = BinToInt(&mmpointer + BinToI

22、nt(&mmpointer + 4) - 4);if(mmpointer + 8 != 1)step+;/step+;if(pointer = end)return -1;mmpointer+8 = 1; /修改本块标志位IntToBin(pointer + 4 + 4 + 1 + n + 4, &mmpointer + 9 + n); /修改本块后向指针IntToBin(pointer, &mmpointer + 4 + 4 + 1 + n + 4); /修改后块前向指针IntToBin(BinToInt(&mmpointer + 4) - n - 13, &

23、amp;mmpointer + 4 + 4 + 1 + n + 4 + 4); /修改后块大小IntToBin(n + 13, &mmpointer + 4); /修改本块大小end = pointer;next = pointer + 4 + 4 + 1 + n + 4;return pointer;void mm_release(int p)int pre;int bac;pre = BinToInt(&mmp);bac = BinToInt(&mmp + BinToInt(&mmp + 4) - 4);mmp + 8 = 0; /修改本块标志位if(Bin

24、ToInt(&mmbac + 8) = 0) /如果后块未使用IntToBin(0, &mmp + BinToInt(&mmp + 4) - 4); /清空本块后向指针IntToBin(0, &mmbac); /清空后块前向指针IntToBin(BinToInt(&mmp + 4) + BinToInt(&mmbac + 4), &mmp + 4); /修改本块大小if(BinToInt(&mmbac + BinToInt(&mmbac + 4) - 4) != -1) /如果后块不是最后一块IntToBin(p, &am

25、p;mmBinToInt(&mmbac + BinToInt(&mmbac + 4) - 4); /修改后块的后块前向指针IntToBin(0, &mmbac + 4); /清空后块大小if(pre = -1)return;if(BinToInt(&mmpre + 8) = 0) /如果前块未使用IntToBin(0, &mmpre + BinToInt(&mmpre + 4) - 4); /清空前块后向指针IntToBin(0, &mmp); /清空本块前向指针IntToBin(BinToInt(&mmpre + 4) + BinToInt(&mmp + 4), &mmpre + 4); /修改前块大小IntToBin(pre, &mmBinToInt(&mmp + BinToInt(&mmp + 4) - 4); /修改后块前向指针IntToBin(0, &mmp + 4); /清空本块大小五实验结果1 .实现的两种分配策略：first-fit 和 next-fit2. 设计测试程序，收集实验数据：First-