银行家算法（c语言）
操作系统课的实验（银行家算法）#include "malloc.h"
#include "stdio.h"
#include "stdlib.h"
#define alloclen sizeof(struct allocation)
#define maxlen sizeof(struct max)
#define avalen sizeof(struct available)
#define needlen sizeof(struct need)
#define finilen sizeof(struct finish)
#define pathlen sizeof(struct path)
struct allocation
{
int value;
struct allocation *next;
};
struct max
{
int value;
struct max *next;
};
struct available /*可用资源数*/
{
int value;
struct available *next;
};
struct need /*需求资源数*/
{
int value;
struct need *next;
};
struct path
{
int value;
struct path *next;
};
struct finish
{
int stat;
struct finish *next;
};
int main()
{
int row,colum,status=0,i,j,t,temp,processtest;
struct allocation *allochead,*alloc1,*alloc2,*alloctemp;
struct max *maxhead,*maxium1,*maxium2,*maxtemp;
struct available *avahead,*available1,*available2,*workhead,*work1,*work2,*worktemp,*worktemp1;
struct need *needhead,*need1,*need2,*needtemp;
struct finish *finihead,*finish1,*finish2,*finishtemp;
struct path *pathhead,*path1,*path2;
printf("\n请输入系统资源的种类数:");
scanf("%d",&colum);
printf("请输入现时内存中的进程数:");
scanf("%d",&row);
printf("请输入已分配资源矩阵:\n");
for(i=0;inext=alloc2->next=NULL;
scanf("%d",&allochead->value);
status++;
}
else
{
alloc2=(struct allocation *)malloc(alloclen);
scanf("%d,%d",&alloc2->value);
if(status==1)
{
allochead->next=alloc2;
status++;
}
alloc1->next=alloc2;
alloc1=alloc2;
}
}
}
alloc2->next=NULL;
status=0;
printf("请输入最大需求矩阵:\n");
for(i=0;inext=maxium2->next=NULL;
scanf("%d",&maxium1->value);
status++;
}
else
{
maxium2=(struct max *)malloc(maxlen);
scanf("%d,%d",&maxium2->value);
if(status==1)
{
maxhead->next=maxium2;
status++;
}
maxium1->next=maxium2;
maxium1=maxium2;
}
}
}
maxium2->next=NULL;
status=0;
printf("请输入现时系统剩余的资源矩阵:\n");
for (j=0;jnext=available2->next=NULL;
work1->next=work2->next=NULL;
scanf("%d",&available1->value);
work1->value=available1->value;
status++;
}
else
{
available2=(struct available*)malloc(avalen);
work2=(struct available*)malloc(avalen);
scanf("%d,%d",&available2->value);
work2->value=available2->value;
if(status==1)
{
avahead->next=available2;
workhead->next=work2;
status++;
}
available1->next=available2;
available1=available2;
work1->next=work2;
work1=work2;
}
}
available2->next=NULL;
work2->next=NULL;
status=0;
alloctemp=allochead;
maxtemp=maxhead;
for(i=0;inext=need2->next=NULL;
need1->value=maxtemp->value-alloctemp->value;
status++;
}
else
{
need2=(struct need *)malloc(needlen);
need2->value=(maxtemp->value)-(alloctemp->value);
if(status==1)
{
needhead->next=need2;
status++;
}
need1->next=need2;
need1=need2;
}
maxtemp=maxtemp->next;
alloctemp=alloctemp->next;
}
need2->next=NULL;
status=0;
for(i=0;inext=finish2->next=NULL;
finish1->stat=0;
status++;
}
else
{
finish2=(struct finish*)malloc(finilen);
finish2->stat=0;
if(status==1)
{
finihead->next=finish2;
status++;
}
finish1->next=finish2;
finish1=finish2;
}
}
finish2->next=NULL; /*Initialization compleated*/
status=0;
processtest=0;
for(temp=0;tempstat==0)
{
for(j=0;jnext,worktemp=worktemp->next)
if(needtemp->value<=worktemp->value)
processtest++;
if(processtest==colum)
{
for(j=0;jvalue+=alloctemp->value;
worktemp1=worktemp1->next;
alloctemp=alloctemp->next;
}
if(status==0)
{
pathhead=path1=path2=(struct path*)malloc(pathlen);
path1->next=path2->next=NULL;
path1->value=i;
status++;
}
else
{
path2=(struct path*)malloc(pathlen);
path2->value=i;
if(status==1)
{
pathhead->next=path2;
status++;
}
path1->next=path2;
path1=path2;
}
finishtemp->stat=1;
}
else
{
for(t=0;tnext;
finishtemp->stat=0;
}
}
else
for(t=0;tnext;
alloctemp=alloctemp->next;
}
processtest=0;
worktemp=workhead;
finishtemp=finishtemp->next;
}
}
path2->next=NULL;
finishtemp=finihead;
for(temp=0;tempstat==0)
{
printf("\n系统处于非安全状态!\n");
exit(0);
}
finishtemp=finishtemp->next;
}
printf("\n系统处于安全状态.\n");
printf("\n安全序列为: \n");
do
{
printf("p%d ",pathhead->value);
}
while(pathhead=pathhead->next);
printf("\n");
return 0;
}
#include "string.h"
#include
#include
#define M 5
#define N 3
#define FALSE 0
#define TRUE 1
/*M个进程对N类资源最大资源需求量*/
int MAX[M][N]={{7,5,3},{3,2,2},{9,0,2},{2,2,2},{4,3,3}};
/*系统可用资源数*/
int AVAILABLE[N]={10,5,7};
/*M个进程对N类资源最大资源需求量*/
int ALLOCATION[M][N]={{0,0,0},{0,0,0},{0,0,0},{0,0,0},{0,0,0}};
/*M个进程已经得到N类资源的资源量 */
int NEED[M][N]={{7,5,3},{3,2,2},{9,0,2},{2,2,2},{4,3,3}};
/*M个进程还需要N类资源的资源量*/
int Request[N]={0,0,0};
void main()
{
int i=0,j=0;
char flag='Y';
void showdata();
void changdata(int);
void rstordata(int);
int chkerr(int);
showdata();
while(flag=='Y'||flag=='y')
{
i=-1;
while(i<0||i>=M)
{
printf("请输入需申请资源的进程号（从0到");
printf("%d",M-1);
printf("，否则重输入!）:");
scanf("%d",&i);
if(i<0||i>=M)printf("输入的进程号不存在，重新输入!\n");
}
printf("请输入进程");
printf("%d",i);
printf("申请的资源数\n");
for (j=0;jNEED[i][j])
{
printf("进程");
printf("%d",i);
printf("申请的资源数大于进程");
printf("%d",i);
printf("还需要");
printf("%d",j);
printf("类资源的资源量!申请不合理，出错!请重新选择!\n");
/*printf("申请不合理，出错!请重新选择!\n");*/
flag='N';
break;
}
else
{
if(Request[j]>AVAILABLE[j])
{
printf("进程");
printf("%d",i);
printf("申请的资源数大于系统可用");
printf("%d",j);
printf("类资源的资源量!申请不合理，出错!请重新选择!\n");
/*printf("申请不合理，出错!请重新选择!\n");*/
flag='N';
break;
}
}
}
if(flag=='Y'||flag=='y')
{
changdata(i);
if(chkerr(i))
{
rstordata(i);
showdata();
}
else
showdata();
}
else
showdata();
printf("\n");
printf("是否继续银行家算法演示,按'Y'或'y'键继续,按'N'或'n'键退出演示: ");
scanf("%c",&flag);
}
}
void showdata()
{
int i,j;
printf("系统可用的资源数为:\n");
printf(" ");
for (j=0;j");
}
printf("\n");
return 0;
}
文件下载
资源详情
[{"title":"（ 15 个子文件 883KB ） 银行家算法（c语言）","children":[{"title":"银行家算法2","children":[{"title":"银行家算法.opt <span style='color:#111;'> 52.50KB </span>","children":null,"spread":false},{"title":"银行家算法.ncb <span style='color:#111;'> 41.00KB </span>","children":null,"spread":false},{"title":"银行家算法.dsp <span style='color:#111;'> 3.37KB </span>","children":null,"spread":false},{"title":"Debug","children":[{"title":"银行家算法.pdb <span style='color:#111;'> 1.05MB </span>","children":null,"spread":false},{"title":"vc60.pdb <span style='color:#111;'> 108.00KB </span>","children":null,"spread":false},{"title":"vc60.idb <span style='color:#111;'> 113.00KB </span>","children":null,"spread":false},{"title":"银行家算法.obj <span style='color:#111;'> 254.18KB </span>","children":null,"spread":false},{"title":"银行家算法.pch <span style='color:#111;'> 1.90MB </span>","children":null,"spread":false},{"title":"银行家算法.ilk <span style='color:#111;'> 771.52KB </span>","children":null,"spread":false},{"title":"银行家算法.exe <span style='color:#111;'> 536.08KB </span>","children":null,"spread":false}],"spread":true},{"title":"算法.txt <span style='color:#111;'> 10.22KB </span>","children":null,"spread":false},{"title":"银行家算法.cpp <span style='color:#111;'> 3.41KB </span>","children":null,"spread":false},{"title":"银行家算法.doc <span style='color:#111;'> 39.00KB </span>","children":null,"spread":false},{"title":"银行家算法.dsw <span style='color:#111;'> 545B </span>","children":null,"spread":false},{"title":"银行家算法.plg <span style='color:#111;'> 254B </span>","children":null,"spread":false}],"spread":true}],"spread":true}]
评论信息
-
-
-
baidu_31731493 :很好。直接拿来当作业了。一分值的给2016-04-05 -
-
西瓜果果 :很好。直接拿来当作业了。一分值的给2016-04-05
-
-
u010377279 :真不错哈，正好是我们操作系统课需要的。感谢楼主啊。2014-06-19
-
-
dongmengjiao :真不错哈，正好是我们操作系统课需要的。感谢楼主啊。2014-06-19
-
-
aqheaven :不错，是个好资料2014-05-19
-
-
aqheaven :不错，是个好资料2014-05-19
-
-
ieyqss :功能基本实现 值得学习2013-05-29
-
-
ieyqss :功能基本实现 值得学习2013-05-29
-
其他资源
- stm32f407 矩阵键盘输入数字
- GT911、GT928、GT9147的驱动程序
- MSP430F5529 超频函数 1.zip
- Android便签应用
- Android 画板(白板)源码 涂鸦 画图 图画
- QML+Chart.js 实现图表显示
- 几何画板5.05最强中文版.exe
- poi导出导入封装（使用注解建立实体与excel映射关系+反射设置实体属性值）
- c++实现电梯调度模拟
- 服装销售管理系统 erp系统 c#源码 winforms 含数据库
- 松弛：一种从Ruby或Rails应用程序向Slack发送通知的简单方法-源码
- 150LC-23立式离心泵尼龙轴承间隙的选择.rar
- boostdesc_bgm,vgg_generated_48,qrcode.zip
- springbootdemo.rar
- Water_Drink_Reminder_Pro_v4.315.256_build_256.apk
- chrome.tar
- 前端开发工具HBuilder下载
- Directx 3D游戏 遥控飞机
- The hacker playbook3 完整版
- C#通过OPC读写PLC数据
- Ruby on Rails 4 Tutorial 中文版.pdf
免责申明
【只为小站】的资源来自网友分享，仅供学习研究，请务必在下载后24小时内给予删除，不得用于其他任何用途，否则后果自负。基于互联网的特殊性，【只为小站】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查；无论 【只为小站】 经营者是否已进行审查，用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场，基于网友分享，根据中国法律《信息网络传播权保护条例》第二十二条之规定，若资源存在侵权或相关问题请联系本站客服人员，zhiweidada#qq.com，请把#换成@，本站将给予最大的支持与配合，做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明
本站所有资源不代表本站的观点或立场，基于网友分享，根据中国法律《信息网络传播权保护条例》第二十二条之规定，若资源存在侵权或相关问题请联系本站客服人员，zhiweidada#qq.com，请把#换成@，本站将给予最大的支持与配合，做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明