deadlock detection
Never
#include<stdio.h> #include<stdlib.h> #include<stdbool.h> int nr,np, work[10]; int avail[10],alloc[10][10]; bool finish[10]; int request[10][10]; void deadLockDetectionAlgorithm(){ for(int i =0;i< nr ; i++) work[i]= avail[i]; for(int i =0 ; i < np ; i++) finish[i] = false; bool possible = true; for(int i =0 ; i< 5 ; i++ ) for(int i =0; i< np ; i++){ possible = true; if(!finish[i]){ for(int j = 0 ;j < nr; j++) if(request[i][j] > work[j] ){ possible=false; break; } if(possible){ for(int k = 0 ;k < nr; k++) work[k]+= alloc[i][k]; finish[i] = true; } } } possible = true; for(int i =0;i< np ;i++) if(!finish[i]){ possible = false; printf("THE SYSTEM IS IN A DEADLOCKED STATE"); break; } if(possible) printf("THERE IS NO DEADLOCK IN THE GIVEN SYSTEM"); } int main(){ printf("ENTER THE NUMBER OF RESOURCES: "); scanf("%d",&nr); printf("ENTER THE AVAILABLE RESOURCES: "); for(int i =0;i< nr ; i++){ scanf("%d",&avail[i]); work[i]= avail[i]; } printf("ENTER THE NUMBER OF PROCESSES : "); scanf("%d",&np); printf("ENTER THE ALLOCATION MATRIX\n"); for(int i = 0;i< np; i++) for(int j =0; j< nr;j++) scanf("%d",&alloc[i][j]); printf("ENTER THE REQUEST MATRIX \n"); for(int i = 0;i< np; i++) for(int j =0; j< nr;j++) scanf("%d",&request[i][j]); deadLockDetectionAlgorithm(); }
Raw Text
-
https://www.facebook.com/SmartHempGummiesChemistWarehouseAU
13 min ago
-
Adult Telegram Channels
14 min ago
-
Delving Deep into the Mysteries of the Mystery School Code
14 min ago
-
Untitled
16 min ago
-
https://www.facebook.com/KetonaraKetoACVGummiesFacts/
30 min ago
-
https://www.facebook.com/KetonaraKetoACVGummiesFacts/
30 min ago
-
https://www.facebook.com/SmartHempGummiesChemistWarehouseAU
35 min ago
-
CP😈 VIDEOS R@PED😏 TEEN GIRLS👧💦💦
39 min ago
-
what is the best site out there?
41 min ago
-
https://www.facebook.com/profile.php?id=61559151118723
52 min ago