OPERATING SYSTEM I

(TOS 2111)
Proposal of Assignment Title: Topic 3
Simulation of Banker’s Algorithm for Deadlock
Avoidance

NAME ID LEC. TUT.

SECTION SECTION

MUHAMAD DANIAL BIN CHIK MAN LIEW 1071114456 TC 103 TC 210

YEE CHIA HOONG 1101106881 TC 103 TC 210

KOH MAN PING 1101107039 TC 103 TC 210

LEE SIAN LOONG 1081106347 TC 103 TC 210

Title

The title that our group has chosen is the simulation of Banker’s algorithm for
deadlock avoidance from topic 3.

Brief Description

About Deadlock

A deadlock is a situation where two or more competing actions are each waiting for the
other to finish, and thus neither ever does. Deadlock is a common problem that occurs in a
multiprocessing because there are many processes that need to be executed in the same time and
might be using the same resources. One of the best examples for deadlock is the two trains
crossing example. When two trains approach each other at a crossing, both shall come to a full
stop and neither shall start up again until the other has gone.

Banker’s Algorithm

Banker’s algorithm is an algorithm that allocates the resources that is available to ensure
that the process will not enter the deadlock state. Therefore, it is also called as deadlock
avoidance algorithm. It is one of the solutions for avoiding deadlock.

Expected Outcome

In this assignment, it is hoped that we can have a better understanding on deadlock and
how does Banker’s algorithm works to solve deadlock. We are expected to come out with a
simulation on how does the Banker’s algorithm works. We are planning in using Java as the
programming language to demonstrate the simulation. The least expectation that we are hoping
for from the simulation is by using command line to demonstrate the example of how Banker’s
algorithm works to solve the deadlock problem.