Operating System Assignment: Resource Allocation and Deadlock

This assignment delves into the core concepts of operating systems, specifically focusing on resource allocation and the potential for deadlocks. The solution provided analyzes a given table of processes, their resource requests, and available resources. It applies the Resource Request Algorithm to determine if the requests can be fulfilled and identifies scenarios where deadlocks might occur. The analysis includes a discussion of the safe state algorithm, demonstrating how it can be used to prevent deadlocks and ensuring that the system does not enter an unsafe state. Furthermore, the document highlights the importance of resource allocation strategies in preventing system failures. The assignment also includes a bibliography with relevant research papers on the subject.

Running head: OPERATING SYSTEM
Operating System
Name of the Student:
Name of the university:
Author Note

1
OPERATING SYSTEM
Task 1:
Given Table:
Process Allocation Request Available
A B C D A B C D A B C D
P0 0 0 1 0 2 0 0 1 2 1 0 0
P1 2 0 0 1 1 0 1 0
P2 0 1 2 0 2 1 0 0
For the process P0,
Request(A) < = Available(A) is true
Request(B) < = Available(B) is true
Request(C) < = Available(C) is true
Request(D) < = Available(D) is false
Hence, the system would be unable to perform the request for process P0.
Request(A) < = Available(A) is true
Request(B) < = Available(B) is true
Request(C) < = Available(C) is true
Request(D) < = Available(D) is true
Hence, the system would be unable to perform the request for process P1.

2
OPERATING SYSTEM
Request(A) < = Available(A) is true
Request(B) < = Available(B) is true
Request(C) < = Available(C) is true
Request(D) < = Available(D) is true
Hence, the system would be able to perform the request for process P2.
The given table was at first subjected to the Resource Request Algorithm and it was seen
that since, out of the three requests two request cannot be performed and hence, the system runs
into a deadlock. In addition to this, the system does not satisfy the safe state algorithm as there is
no safe sequence for the provide table. This is because the max allocations for any of the process
cannot be satisfied with the available resources.

3
OPERATING SYSTEM
Bibliography
Jiang, L., 2019, June. Process Security Sequence Improvement Algorithm Based on Banker
Algorithm. In Journal of Physics: Conference Series (Vol. 1237, No. 2, p. 022111). IOP
Publishing.
Wei, L. and Fung, C., 2015, June. FlowRanger: A request prioritizing algorithm for controller
DoS attacks in Software Defined Networks. In 2015 IEEE International Conference on
Communications (ICC) (pp. 5254-5259). IEEE.