# Processes and Segmentation

The following problem was on my final and in Gate 2006, but I don't understand how to solve it:

Different methods of memory management have different overheads:

• The paging method for memory management uses two-level paging, and its storage overhead is $P$.
• The storage overhead for the segmentation method is $S$.
• The storage overhead for the segmentation and paging method is $T$.

What is the relation among the overheads in the concurrent execution of the processes below?

(a) $P < S < T \hspace{2em}$
(b) $S < P < T\hspace{2em}$
(c) $S < T < P\hspace{2em}$
(d) $T < S < P$

Process    Total Size (in KB)    Number of segments
P1              195                    4
P2              254                    5
P3               45                    3
P4              364                    8

• The page size is 1 KB.
• The size of an entry in the page table is 4 bytes.
• The size of an entry in the segment table is 8 bytes.
• The maximum size of a segment is 256 KB.
-

## migrated from cstheory.stackexchange.comNov 24 '12 at 8:56

This question came from our site for theoretical computer scientists and researchers in related fields.