# Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 19 (Page No. 467)

31 views
In theory, resource trajectory graphs could be used to avoid deadlocks. By clever scheduling, the operating system could avoid unsafe regions. Is there a practical way of actually doing this?

## Related questions

1
40 views
One way to eliminate circular wait is to have rule saying that a process is entitled only to a single resource at any moment. Give an example to show that this restriction is unacceptable in many cases.
The banker’s algorithm is being run in a system with $m$ resource classes and $n$ processes. In the limit of large $m$ and $n,$ the number of operations that must be performed to check a state for safety is proportional to $m^{a} n^{b}.$ What are the values of $a$ and $b?$
Suppose that process $A$ in Fig. 6-12 requests the last tape drive. Does this action lead to a deadlock?