|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| n | We can
combine the previous approaches |
||||||||||||||||
| into the
following way: |
|||||||||||||||||
| u | Group resources
into a number of different |
||||||||||||||||
| classes and order
them. Ex: |
|||||||||||||||||
| F | Swappable space
(secondary memory) |
||||||||||||||||
| F | Process resources
(I/O devices, files...) |
||||||||||||||||
| F | Main memory... |
||||||||||||||||
| u | Use prevention
of circular wait to prevent |
||||||||||||||||
| deadlock between
resource classes |
|||||||||||||||||
| u | Use the most
appropriate approach for each |
||||||||||||||||
| class for
deadlocks within each class |
|||||||||||||||||
