Deadlock AvoidanceName:Institutional affiliation IntroductionA multipurpose operating system should have mechanism to handle deadlocks between threads that are being processed concurrently. Deadlock is a conflict between threads, which occurs when two or more threads of processes request for a resource that is held by another thread of process. Mutex on the other hand is a deadlock that develop when process a is holding a resource, while it is waiting for a resource held by a different process, which in turn is holding the resource while waiting for the resource held by the first process. As the result, the two processes are both held in a permanent conflict. At the moment, Top Secret, Inc. (TSI) resolves this situation by reboot the servers. However, the problem reoccurs when there is a lot of traffic in the TSI website during peak hour. This paper will recommends a deadlock avoidance approach most suitable for the TSI web server application that is not using an ordered (Froese et al, 2016).Possible SolutionThe best approach towards avoiding Mutex is by implementing deadlock avoidance is the bankers algorithm. The technique was developed by Edsger