Banker's Algorithm Optimalization to Dynamically Avoid Deadlock in Operating System

Abstract

Operating systems hold the responsibility to ensure a computer works as it was intended, including that every resource in a computer is managed and used by any process needing them. Bad resource allocation can lead to a condition where the resources cannot be accessed because they are still used by a frozen process, known as deadlock. Deadlock avoidance in the operating system is usually done using a banker’s algorithm. The current algorithm still possesses limitations, including the need to determine the number of processes before starting the calculation. This paper proposes an optimized banker’s algorithm that can be intercepted in the middle of execution in case of a new process requests some resources so deadlock can be avoided dynamically.