CS604 GDB Solution Fall 2017
#1

CS604 Graded Discussion Board Solution
Fall 2017

GDB Topic:
 
Suppose a system allows deadlocks to occur in a system and then run deadlock detection algorithm to detect deadlocks in the system and then recover system from deadlocks.
 
You have been given two approaches for running a deadlock detection algorithm:
a.[font=Times New Roman]        [/font]Running an algorithm on the system every time a request is granted.
b.[font=Times New Roman]        [/font]Running an algorithm on the system after specified period of time.
 
In your opinion, which approach will best suit the system considering that deadlocks are less likely to occur in the system and processes are frequently requesting resources.
 
You are required to give your own opinion. Keep your answer precise and to the point.

Solution:

In my opinion, approach 'b' will best suit this system because as the deadlocks are less likely to happen and processes are frequently requesting resources, running the algorithm after specified period of time will not slow down the system much but if the first approach is used that after every request the algorithm is run, and as the requests are quite frequent, it will slow down the system a log and processes will experience lag.
Hence its best to run the detection algorithm after a specified time for deadlock detection.
Reply


Possibly Related Threads…
Thread / Author Replies Views Last Post
Last Post by fubbave
10-09-2021, 03:25 AM
Last Post by fubbave
10-08-2021, 03:52 PM



Users browsing this thread: 1 Guest(s)