CS215
Assignment #8 (written assignment)
DUE: Thursday, 12/4/2014
The first three relate to deadlocks (Chapter 7), and the subsequent problems are about virtual memory (Chapter 9).
- 7.10 (page 342)
- 7.16 (page 343)
- Suppose we had 18 instances
of a resource (of a single type), allocated as in the table below, which also
gives the maximum need of each process. Is this a safe state or not?
If the "16" were "18", would this change anything? Explain your answers.
| Process |
Allocated |
Maximum |
| 1 |
3
|
10
|
| 2 |
7
|
16
|
| 3 |
4
|
7
|
| 4 |
1
|
12
|
- In class we considered the reference string
\(\omega = \) 12345423241513 and found that \(C(FIFO, 3, \omega) = 11\).
Do the appropriate computation to show that \(C(FIFO, 4, \omega) = 6\),
i.e., that more memory can help.
- Verify Belady's anomaly (i.e., that more memory doesn't necessarily help) using the reference string \(\omega' = \) 123412512345. That is, compute \(C(FIFO, 3, \omega')\) and \(C(FIFO, 4, \omega')\) to show that \(C(FIFO, 3, \omega') < C(FIFO, 4, \omega')\).
- 9.16 (page 447).
- 9.21 (page 448).
Back to CS215 Home Page