We consider a program that has two segments that are shown in the below table: Segment 0,
Fantastic news! We've Found the answer you've been seeking!
Question:
We consider a program that has two segments that are shown in the below table: Segment 0, containing instructions, and segment 1, containing data. The memory is a virtual memory system with:
- virtual addresses that have a 4-bit page number,
- and a 10-bit offset.
The page table entries are given as follows:
Segment 0 | Segment 1 | ||
Virtual Page # | Page Frame # | Virtual Page # | Page Frame # |
0 | 2 | 0 | On Disk |
1 | On Disk | 1 | 14 |
2 | 11 | 2 | 9 |
3 | 5 | 3 | 6 |
4 | On Disk | 4 | On Disk |
5 | On Disk | 5 | 13 |
6 | 4 | 6 | 8 |
7 | 3 | 7 | 12 |
For each of the following cases, either give the real (actual, physical ) memory address which results from dynamic address translation or identify the page fault.
a) Fetch from segment 1, page 1, offset 3
b) Store into segment 0, page 0, offset 16
c) Fetch from segment 1, page 4, offset 28
d) Jump to location in segment 1, page 3, offset 32
Related Book For
Posted Date: