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

Definitions of the procedures cons, Show that we can represent pairs of non...

Show that we can represent pairs of nonnegative integers using only numbers and arithmetic operations if we represent the pair a and b as the integer that is the product 2a3b. Give

What are the four factors of open source software, What are the four signif...

What are the four significant factors that led to the development of open source software? 1. To diminish the high control value of the Proprietary Software 2. To avoid disc

Building is into our operational processes, Building IS into our operationa...

Building IS into our operational processes - Information System Although information systems are becoming increasingly prevalent they are not always the correct solution to ev

Abap/4 module can "branch to " or "call" the next screen, The commands thro...

The commands through Which an ABAP/4 Module can "branch to " or "call" the next screen are Set screen Call screen , Leave screen, Leave to screen

Define file record length, Define File record length ? File record leng...

Define File record length ? File record length must be selected to match the data characteristics.

Difference between visual check and parity check, Difference between Visual...

Difference between Visual check and Parity check Visual check This is checking for errors by comparing entered data with original document (NOTE: this is not the same as

Why the tcp checksum is necessary, Is the TCP checksum necessary? Yes, ...

Is the TCP checksum necessary? Yes, TCP Checksum is essential. TCP layer is liable for error detection, transmission of packets if needed, error control, reassembly of packe

First-order models, First-Order Models: Here if we proposed first-orde...

First-Order Models: Here if we proposed first-order logic as a good knowledge representation language than propositional logic is just because there is more expressive than we

Define the three prime processes of UML, Define the three prime processes o...

Define the three prime processes of uml The three prime processes were OMT (Rumbaugh), OOSE (Jacobson) and Booch. OMT was strong in analysis, while Booch was strong in design a

Explain shared memory system and tightly coupled system, Shared Memory Syst...

Shared Memory System / Tightly Coupled System Shared memory multiprocessors have the subsequent features: For real-time high-speed processing these systems are preferabl

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages