2,800 views
2 votes
2 votes
Assume that a task is divided into four equal-sized segments and that the system
builds an eight-entry page descriptor table for each segment. Thus, the system has a
combination of segmentation and paging. Assume also that the page size is 2 Kbytes.
a. What is the maximum size of each segment?
b. What is the maximum logical address space for the task?
c. Assume that an element in physical location 00021ABC is accessed by this task.
What is the format of the logical address that the task generates for it? What is the
maximum physical address space for the system?

My answers to the parts were as follows

(a) 16KB

(b)16 bits

(c)4GB physical memory

Are my answers correct?

1 Answer

0 votes
0 votes
(a)   (8 entries in the page table) x 2K = 16K.

(b)    (16 K) x 4 segments per task = 64K.

(c)    

We know the offset is 11 bits since the page size is 2K. The page table for each segment has eight entries, so it needs 3 bits. That leaves 2 bits for the segment number. So the format of the address is 2 bits for segment number, 3 bits for page number, and 11 bits for offset.

 The physical address is 32 bits wide total, so the frame number must be 21 bits wide. Thus 00021ABC is represented in binary as:

            Frame                           Offset

            0000 0000 0000 0010 0001  | 1010 1011 1100

   The maximum physical address space is 2^32 = 4 GB.
edited by

Related questions

2 votes
2 votes
0 answers
3
1 votes
1 votes
1 answer
4
snaily16 asked Jan 10, 2019
469 views
In a demand paging system page fault rate 0.60 and page fault service time 8 milliseconds, memory access time 200 nano seconds. Find out effective access time in nano sec...