One method of recovering from deadlock is to kill the lowest-priority process (or processes) involved in the deadlock. This (these) process(es) could then be restarted and once again allowed to compete for resources. What potential problem might develop in a system using such an algorithm?
What will be an ideal response?
If these processes tend to become deadlocked again, the algorithm could result in indefinite postponement.
Computer Science & Information Technology
You might also like to view...
In the Eight Queens problem, each column can contain ______.
a) exactly one queen b) exactly two queens c) at most two queens d) at most three queens
Computer Science & Information Technology
A characteristic of defensive programming is:
a. readable code b. predictable results c. enforcement of function pre-conditions d. none of the above e. all of the above
Computer Science & Information Technology