Illustration of Safe and Unsafe State Using Transition Table and Java Simulation

The burden of allocation and utilization when it comes to system resources lies completely in the domain of the operating system. Giving resources to processes as they require them for execution is a necessary task that demands all conscientiousness as it pushes the system to different states because the limitedness of system resources don?t leave processes or programs with ample supply of their desired demand of resources to be allocated when needed, this implies that there is always a wait pull or queue for system resources as long as processes keep requesting for resource. The crucial aspect in allocating or de - allocating resources is the technicalities involved that pertains to ensuring that processes are not holding resources other processes will need without making use of them. When this two task allocation and de - allocation is not sufficiently managed many processes can be resource deficient waiting on the system for resources to be allocated that are kept by processes which are waiting for more resources which leads to concept starving, and the resultant effect of this is called unsafe state in which processes cannot execute to completion for not getting more resources, and it can be worsen a deadlock state which no execution of process is possible. However, with efficient algorithms and techniques a system can allocate its resources to all request and all waiting processes can run to completion. There is always a sequence or order to follow to successfully allocate resources to processes for to avoid unsafe state leading to deadlock state, this sequence is known as safe sequence. This research work is to illustrate safe and unsafe state using transition table, and simulate how a system can be in safe state using the deadlock avoidance algorithm implemented in java programming language.