Deadlock Avoidance

International Journal of Research and Reviews in Social and Applied Sciences, Volume 8, Issue 1. (AUGUST 2022)

9 Pages Posted: 17 Apr 2023

Date Written: August 21, 2022

Abstract

This seminar paper is focused on deadlock avoidance. Deadlock can be defined as a situation where a set of processes are blocked because each process is holding a resource and waiting for another resource acquired by some other process In deadlock avoidance, the request for any resource will be granted if the resulting state of the system doesn't cause deadlock in the system. In order to avoid deadlocks, the process must tell OS, the maximum number of resources a process can request to complete its execution. A deadlock prevention algorithm organizes resource usage by each process to ensure that at least one process is always able to get all the resources it needs. One such example of deadlock algorithm is Banker's algorithm.

Keywords: DEADLOCK, AVOIDANCE

Suggested Citation

Benjamin, Ubokobong Effiong and J., Mfreke Umoh, Deadlock Avoidance (August 21, 2022). International Journal of Research and Reviews in Social and Applied Sciences, Volume 8, Issue 1. (AUGUST 2022), Available at SSRN: https://ssrn.com/abstract=4196107

Ubokobong Effiong Benjamin (Contact Author)

Akwa Ibom State Polytechnic

Mfreke Umoh J.

Akwa Ibom State Polytechnic ( email )

Ikot Osurua, Ikot Ekpene
Nigeria

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Downloads
131
Abstract Views
485
Rank
409,243
PlumX Metrics