Consider the Banker's algorithm for deadlock avoidance (chapter 7.6 from the eReadings). Give an example of the application of this algorithm for 7 processes(P1, .., P7) and 5 resource types (R1, .., R5). Your example must be original (different from your colleagues' examples).
Sun | Mon | Tue | Wed | Thu | Fri | Sat |
---|---|---|---|---|---|---|
29 | 30 | 1 | 2 | 3 | 4 | 5 |
6 | 7 | 8 | 9 | 10 | 11 | 12 |
13 | 14 | 15 | 16 | 17 | 18 | 19 |
20 | 21 | 22 | 23 | 24 | 25 | 26 |
27 | 28 | 29 | 30 | 31 | 1 | 2 |