fork download
copy 
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3.  
  4. int max[100][100];
  5. int alloc[100][100];
  6. int need[100][100];
  7. int avail[100];
  8. int n, r;
  9.  
  10. void input();
  11. void show();
  12. void cal();
  13.  
  14. int main() {
  15.     printf("********** Deadlock Detection Algorithm ************\n");
  16.     input();
  17.     show();
  18.     cal();
  19.     system("pause"); // Replaces getch()
  20.     return 0;
  21. }
  22.  
  23. void input() {
  24.     int i, j;
  25.     printf("Enter the number of processes: ");
  26.     scanf("%d", &n);
  27.  
  28.     printf("Enter the number of resource instances: ");
  29.     scanf("%d", &r);
  30.  
  31.     printf("Enter the Max Matrix:\n");
  32.     for (i = 0; i < n; i++) {
  33.         for (j = 0; j < r; j++) {
  34.             scanf("%d", &max[i][j]);
  35.         }
  36.     }
  37.  
  38.     printf("Enter the Allocation Matrix:\n");
  39.     for (i = 0; i < n; i++) {
  40.         for (j = 0; j < r; j++) {
  41.             scanf("%d", &alloc[i][j]);
  42.         }
  43.     }
  44.  
  45.     printf("Enter the Available Resources:\n");
  46.     for (j = 0; j < r; j++) {
  47.         scanf("%d", &avail[j]);
  48.     }
  49. }
  50.  
  51. void show() {
  52.     int i, j;
  53.     printf("\nProcess\t Allocation\t Max\t Available\n");
  54.  
  55.     for (i = 0; i < n; i++) {
  56.         printf("P%d\t ", i + 1);
  57.         for (j = 0; j < r; j++) {
  58.             printf("%d ", alloc[i][j]);
  59.         }
  60.  
  61.         printf("\t");
  62.         for (j = 0; j < r; j++) {
  63.             printf("%d ", max[i][j]);
  64.         }
  65.  
  66.         printf("\t");
  67.         if (i == 0) {
  68.             for (j = 0; j < r; j++)
  69.                 printf("%d ", avail[j]);
  70.         }
  71.         printf("\n");
  72.     }
  73. }
  74.  
  75. void cal() {
  76.     int finish[100], flag = 1, k, c1 = 0;
  77.     int dead[100], safe[100];
  78.     int i, j;
  79.  
  80.     for (i = 0; i < n; i++)
  81.         finish[i] = 0;
  82.  
  83.     // Calculate Need Matrix
  84.     for (i = 0; i < n; i++) {
  85.         for (j = 0; j < r; j++) {
  86.             need[i][j] = max[i][j] - alloc[i][j];
  87.         }
  88.     }
  89.  
  90.     while (flag) {
  91.         flag = 0;
  92.         for (i = 0; i < n; i++) {
  93.             int c = 0;
  94.             for (j = 0; j < r; j++) {
  95.                 if ((finish[i] == 0) && (need[i][j] <= avail[j])) {
  96.                     c++;
  97.                 }
  98.             }
  99.  
  100.             if (c == r) {
  101.                 for (k = 0; k < r; k++) {
  102.                     avail[k] += alloc[i][k];
  103.                 }
  104.                 finish[i] = 1;
  105.                 flag = 1;
  106.             }
  107.         }
  108.     }
  109.  
  110.     j = 0;
  111.     flag = 0;
  112.  
  113.     for (i = 0; i < n; i++) {
  114.         if (finish[i] == 0) {
  115.             dead[j] = i;
  116.             j++;
  117.             flag = 1;
  118.         }
  119.     }
  120.  
  121.     if (flag == 1) {
  122.         printf("\n\nSystem is in Deadlock. The deadlocked processes are:\n");
  123.         for (i = 0; i < j; i++) {
  124.             printf("P%d\t", dead[i]);
  125.         }
  126.         printf("\n");
  127.     } else {
  128.         printf("\nNo Deadlock Occurred.\n");
  129.     }
  130. }
  131.  
Success #stdin #stdout #stderr 0.01s 5288KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
********** Deadlock Detection Algorithm ************
Enter the number of processes: Enter the number of resource instances: Enter the Max Matrix:
Enter the Allocation Matrix:
Enter the Available Resources:

Process	 Allocation	 Max	 Available

No Deadlock Occurred.
stderr
copy 
sh: 1: pause: not found
https://ideone.com/4oQlP4
language:
C (gcc 8.3)
created:
12 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!