三存儲(chǔ)管理動(dòng)態(tài)不等長存儲(chǔ)資源分配算法

1、實(shí)驗(yàn)三 存儲(chǔ)管理——?jiǎng)討B(tài)不等 長存儲(chǔ)資源分配算法,實(shí)驗(yàn)?zāi)康膶?shí)驗(yàn)內(nèi)容實(shí)驗(yàn)準(zhǔn)備實(shí)驗(yàn)設(shè)計(jì)參考代碼實(shí)驗(yàn)結(jié)果思考題,實(shí)驗(yàn)?zāi)康?理解動(dòng)態(tài)異長存儲(chǔ)分區(qū)資源管理，掌握所需數(shù)據(jù)結(jié)構(gòu)和管理程序，了解各種存儲(chǔ)分配算法的優(yōu)點(diǎn)和缺點(diǎn)。,實(shí)驗(yàn)內(nèi)容,分析UNIX最先適應(yīng)(FF)存儲(chǔ)分配算法，即map數(shù)據(jù)結(jié)構(gòu)、存儲(chǔ)分配函數(shù)malloc()和存儲(chǔ)釋放函數(shù)mfree()，找出與算法有關(guān)的成分。 修改上述與算法有關(guān)的成分，使其分別體現(xiàn)BF分配原則和

2、WF分配原則。,實(shí)驗(yàn)設(shè)計(jì),按內(nèi)容要求編寫最佳適應(yīng)和最壞適應(yīng)存儲(chǔ)分配算法。 編寫測(cè)試程序，對(duì)存儲(chǔ)分配表進(jìn)行初始化。然后對(duì)用戶輸入的請(qǐng)求和釋放，按算法動(dòng)態(tài)更新存儲(chǔ)分配表，并將每次更新之后的存儲(chǔ)分配表在屏幕上顯示出來。,參考代碼,#ifdef HAVE_CONFIG_H#include #endif#include #include #define MAPSIZE 100struct map //存儲(chǔ)資源表結(jié)構(gòu){

3、 int m_addr; int m_size;};struct map map[MAPSIZE]; //存儲(chǔ)資源表,//BF存儲(chǔ)分配函數(shù)int BF_malloc(struct map *mp,int size) { register int a,s; register struct map *bp,*bpp; for(bp = mp; bp->m_size; bp++) {

4、 if (bp->m_size >= size) { a = bp->m_addr; s = bp->m_size; for(bpp = bp; bpp->m_size; bpp++) { //最佳適應(yīng) if(bpp->m_size >=

5、 size && bpp->m_size m_addr; s = bpp->m_size; bp = bpp; } },bp->m_addr += size; if ((bp->m_size -= size) == 0)

6、 do { bp++; (bp-1)->m_addr = bp->m_addr; } while((bp-1)->m_size = bp->m_size); return(a); }

7、 } return(-1);},//WF存儲(chǔ)分配函數(shù)int WF_malloc(struct map *mp,int size) { register int a,s; register struct map *bp,*bpp; for(bp = mp; bp->m_size; bp++) { if (bp->m_size >= size)

8、 { a = bp->m_addr; s = bp->m_size; for(bpp = bp; bpp->m_size; bpp++) { //最壞適應(yīng) if(bpp->m_size > s) { a

9、 = bpp->m_addr; s = bpp->m_size; bp = bpp; } },bp->m_addr += size; if ((bp->m_size -=size) == 0) do

10、 { bp++; (bp-1)->m_addr = bp->m_addr; } while((bp-1)->m_size = bp->m_size); return(a); } } return(-1);},

11、//存儲(chǔ)釋放函數(shù)void mfree(struct map *mp,int aa,int size) { register struct map *bp; register int t; register int a; a = aa; for(bp = mp; bp->m_addrm_size != 0; bp++) ; if(bp>mp &&

12、; (bp-1)->m_addr+(bp-1)->m_size==a) { //與前合并 (bp-1)->m_size += size; if (a+size == bp->m_addr) { //前后合并 (bp-1)->m_size += bp->m_size; while

13、(bp->m_size) { bp++; (bp-1)->m_addr = bp->m_addr; (bp-1)->m_size = bp->m_size; } } },else { if (a

14、+size == bp->m_addr && bp->m_size) { //與后合并 bp->m_addr -= size; bp->m_size += size; } else if (size) do { //無合并

15、 t = bp->m_addr; bp->m_addr = a; a = t; t = bp->m_size; bp->m_size = size; bp++; }

16、 while (size = t); }},void init(){ struct map *bp; int addr,size; int i=0; bp=map; printf("Please input starting addr and total size:"); scanf("%d,%d",&

17、addr,&size); bp->m_addr=addr; bp->m_size=size; (++bp)->m_size=0; //表尾},void show_map(){ int i=0; //system("clear"); //清屏 struct map *bp; bp=map; printf(&quo

18、t;\nCurrent memory map...\n"); printf("Address\t\tSize\n"); while(bp->m_size!=0) { printf("\n",bp->m_addr,bp->m_size); bp++; } printf("\n"

19、;);},main(){ int a,s; int c; int i; init(); printf("please input, b for BF, w for WF:"); scanf("%c",&c); do { show_map(); //顯示存儲(chǔ)資源表 printf(“please

20、 input, b for BF, w for WF, e for exit); printf("Please input,1 for request,2 for release,0 for exit:"); scanf("%d",&c);,switch(i) { case 1:

21、printf("Please input size:"); scanf("%d", &s); if(c==’b’) //BF a=BF_malloc(map,s)) else //WF a=WF_malloc(m

22、ap,s)) if(a==-1) printf("request can't be satisfied\n"); else printf("alloc memory at address:%d,size:%d\n",a,s);

23、 break; case 2: printf("Please input addr and size:"); scanf("%d,%d",&a,&s); mfree(map,a,s); break;

24、 case 0: exit(0); } } while(1);},實(shí)驗(yàn)結(jié)果,Please input starting addr and total size:0,100please input, b for BF, w for WF:bPlease input,1 for request,2 for release,0 for exit:1Please input

25、 size:20alloc memory at address:0,size:20Current memory map...Address SizePlease input,1 for request,2 for release,0 for exit:1Please input size:35,alloc memory at address:20,size:35Current memory map...Address

26、 SizePlease input,1 for request,2 for release,0 for exit:1Please input size:15alloc memory at address:55,size:15Current memory map...Address SizePlease input,1 for request,2 for release,0 for exit:2Please input

27、 addr and size:20,35Current memory map...Address Size,Please input,1 for request,2 for release,0 for exit:1Please input size:15alloc memory at address:70,size:15Current memory map...Address SizePlease input,