(This is the older material - click here - for current specification content)
This is an awkward situation where processes have effectively locked themselves out because they are all waiting on each other to do something.
In this case the scheduler has to deal with the problem.
It can do so by applying an extra rule with regards to resources. For example,
- It does not allow a process to start until all the resources it needs are available
- The scheduler could always allocate resources in the same order
- If a deadlock is detected i.e. processes have been sitting in the WAIT queue for a long time, then the operating system removes a process
All these approaches would work, but once again, each one has its good and bad points.
Challenge see if you can find out one extra fact on this topic that we haven't already told you
Click on this link: Deadlock Scheduling
Copyright © www.teach-ict.com