Homework 9
Homework 9
Homework 9
1.
Consider the page table shown in Figure 9.30 for a system with 12-bit
virtual and physical addresses and with 256-byte pages. The list of free
page frames is D, E, F (that is, D is at the head of the list, E is second,
and F is last).
Page
Page Frame
2.
9EF
111
700
0FF
b.
3.
LRU replacement
FIFO replacement
Optimal replacement
4.
The page table shown in Figure 9.32 is for a system with 16-bit virtual
and physical addresses and with 4,096-byte pages. The reference bit is
set to 1 when the page has been referenced. Periodically, a thread zeroes
out all values of the reference bit. A dash for a page frame indicates
the page is not in memory. The page-replacement algorithm is localized
LRU, and all numbers are provided in decimal.
a.
Page Frame
Reference Bit
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
9
1
14
10
13
8
15
0
5
4
3
2
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
hexadecimal or decimal. Also set the reference bit for the appropriate entry in the page table.
0xE12C
0x3A9D
0xA9D9
0x7001
0xACA1
b.
c.
5.
Request 6-KB
Request 250 bytes
Request 900 bytes
Request 1,500 bytes
Request 7-KB
Next, modify the tree for the following releases of memory. Perform
coalescing whenever possible:
When a new page was required, the replaced page was modied 50
percent of the time.
Calculate the effective instruction time on this system, assuming that the
system is running one process only and that the processor is idle during
drum transfers.
7.