Write an algorithm for deadlock detection, Computer Engineering

Assignment Help:

Write an algorithm for deadlock detection.

An algorithm for deadlock detection:

1. Assume that Work and Finish be vectors of length m and n, correspondingly.

Initialize:

(a) Work = Available

(b) For i = 1,2, ..., n, if Allocation i ¹≠ 0, then

Finish[i] = false; otherwise, Finish[i] = true.

2. Determine an index i such as both:

(a) Finish[i] == false

i. (b) Requesti ≤ Work

If no such i exists, go to step 4.

3. Work = Work + Allocationi

Finish[i] = true go to step 2.

4. If Finish[i] == false, for some i, 1 ≤ i ≤ n, then the system is in deadlock state. Furthermore, if Finish[i] == false, then Pi is deadlocked.

Related Discussions:- Write an algorithm for deadlock detection

Data structure, explain different type of sparse matrix

explain different type of sparse matrix

By which analog signal combine with a carrier frequency, Analog signals can...

Analog signals can be by combining them with a carrier frequency (A) Carried (B) Transported (C) Multiplexed

Develop a system to store change logs , The ?rst task in the project is to ...

The ?rst task in the project is to develop a sane system to store change logs and versions of ?les. The simplest approach is to create a "dot" directory in the location of the ?le

Kirchoff''s voltage law , Kirc hoff's Voltage Law The sum ...

Kirc hoff's Voltage Law The sum of all the voltage drops around a closed circuit loop will add to zero V1+(-V2)+(-V3)+(-V4)= 0

#chemistry, Please explain the construction and working of calomel electrod...

Please explain the construction and working of calomel electrode..

Objectives of parallel computing, Objectives of Parallel Computing Aft...

Objectives of Parallel Computing After reading this topic, you would be able to: Tell historical details of parallel computing; Explain the fundamental ideas of dis

Third partial product of 1311 in binary, third partial product of 1311 in...

third partial product of 13*11 in binary

#logic function, Minimize the following logic function using K-maps and rea...

Minimize the following logic function using K-maps and realize using NAND and NOR gates. F(A,B,C,D) =?_m(1,3,5,8,9,11,15) + d(2,13).

Virtulization, Analyse the future of Operating Systems with reference to Vi...

Analyse the future of Operating Systems with reference to Virtualisation.words accepted#

Typicality of virtual addresses, The typicality of virtual addresses is tha...

The typicality of virtual addresses is that: They are longer than physical addresses because total addressed memory in virtual memory is more than actual physical memory.

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages