死锁检测的程序C语言,死锁检测算法（C语言）
#include #include
int main(){
int avaFlag = 0;
int count = 0;
int L[5] = {0,0,0,0,0};
//无死锁
//int Allocation[5][3] = {0,1,0,2,0,0,3,0,2,2,1,1,0,0,2};
//int Need[5][3] = {7,4,3,1,2,2,6,0,0,0,1,1,4,3,1};
//int Available[3] = {3,3,2};
//有死锁
int Allocation[5][3] = {0,3,0,3,0,2,3,0,2,2,1,1,0,0,2};
int Need[5][3] = {7,2,3,0,2,0,6,0,0,0,1,1,4,3,1};
int Available[3] = {2,1,0};
printf(" 进程号 进程已分配资源 进程资源需求 可利用资源 ");
printf(" A B C A B C A B C ");
for(int a = 0; a < 5; a++){
printf("%d ",a);
for(int b = 0; b < 3; b++){
printf("%d ",Allocation[a][b]);
}
printf(" ");
for(int b = 0; b < 3; b++){
#include #include int main(){ int avaFlag = 0; int count = 0; int L[5] = {0,0,0,0,0}; //无死锁 //int Allocation[5][3] = {0,1,0,2,0,0,3,0,2,2,1,1,0,0,2}; //int Need[5][3] = {7,4,3,1,2,2,6,0,0,0,1,1,4,3,1}; //int Available[3] = {3,3,2}; //有死锁 int Allocation[5][3] = {0,3,0,3,0,2,3,0,2,2,1,1,0,0,2}; int Need[5][3] = {7,2,3,0,2,0,6,0,0,0,1,1,4,3,1}; int Available[3] = {2,1,0}; printf(" 进程号 进程已分配资源 进程资源需求 可利用资源 "); printf(" A B C A B C A B C "); for(int a = 0; a < 5; a++){ printf("%d ",a); for(int b = 0; b < 3; b++){ printf("%d ",Allocation[a][b]); } printf(" "); for(int b = 0; b < 3; b++){