Scribd
Upload
36 views

Paging and Segmentation

The document discusses non-contiguous memory allocation techniques. It describes paging where memory is divided into fixed-size pages and frames. It also describes segmentation where memory is divided into variable-sized segments. Both techniques allow processes to be stored non-contiguously in memory. Logical addresses are translated to physical addresses using page/segment tables containing frame/base addresses.

Uploaded by

fayizkozhikode
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
36 views

Paging and Segmentation

The document discusses non-contiguous memory allocation techniques. It describes paging where memory is divided into fixed-size pages and frames. It also describes segmentation where memory is divided into variable-sized segments. Both techniques allow processes to be stored non-contiguously in memory. Logical addresses are translated to physical addresses using page/segment tables containing frame/base addresses.

Uploaded by

fayizkozhikode
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 33

Non-Contiguous Memory Allocation-

Non-Contiguous Memory Allocation-

● Non-contiguous memory allocation is a memory allocation technique.


● It allows to store parts of a single process in a non-contiguous
fashion.
● Thus, different parts of the same process can be stored at different
places in the main memory.
Techniques-
There are two popular techniques used for non-contiguous memory allocation-
Paging-
● Paging is a fixed size partitioning scheme.
● In paging, secondary memory and main memory are divided into equal fixed
size partitions.
● The partitions of secondary memory are called as pages.
● The partitions of main memory are called as frames.
● Each process is divided into parts where size of each part is same as page
size.
● The size of the last part may be less than the page size.
● The pages of process are stored in the frames of main memory depending
upon their availability.
Example-

● Consider a process is divided into 4 pages P0, P1, P2 and P3.


● Depending upon the availability, these pages may be stored in the main memory
frames in a non-contiguous fashion as shown-
Translating Logical Address into Physical Address-

● CPU always generates a logical address.


● A physical address is needed to access the main memory.

Following steps are followed to translate logical address into physical address-
Step-01:
CPU generates a logical address consisting of two parts-
1. Page Number
2. Page Offset

● Page Number specifies the specific page of the process from which CPU
wants to read the data.
● Page Offset specifies the specific word on the page that CPU wants to
read.
Step-02:

For the page number generated by the CPU,


Page Table provides the corresponding frame number (base address of the frame)
where that page is stored in the main memory.
Step-03:

The frame number combined with the page offset forms the required physical
address.

●
● Frame number specifies the specific frame where the required page is stored.
● Page Offset specifies the specific word that has to be read from that page.
Paging Hardware
The following diagram illustrates the above steps of translating logical address into
physical address-
Advantages-

The advantages of paging are-


● It allows to store parts of a single process in a non-contiguous
fashion.
● It solves the problem of external fragmentation.
Disadvantages-

The disadvantages of paging are-


● It suffers from internal fragmentation.
● There is an overhead of maintaining a page table for each
process.
Segmentation-
● Like Paging, Segmentation is another non-contiguous
memory allocation technique.
● In segmentation, process is not divided blindly into fixed size
pages.
● Rather, the process is divided into modules for better
visualization.
Characteristics-

● Segmentation is a variable size partitioning scheme.


● In segmentation, secondary memory and main memory are
divided into partitions of unequal size.
● The size of partitions depend on the length of modules.
● The partitions of secondary memory are called as segments.
Example-
Consider a program is divided into 5 segments as-
Segment Table-

● Segment table is a table that stores the information about each


segment of the process.
● It has two columns.
● First column stores the size or length of the segment.
● Second column stores the base address or starting address of the
segment in the main memory.
● Segment table is stored as a separate segment in the main
memory.
● Segment table base register (STBR) stores the base address of
the segment table.
For the above illustration, consider the segment table is-
Here,
● Limit indicates the length or size of the segment.
● Base indicates the base address or starting address of the segment in the
main memory.

In accordance to the above segment table, the segments are stored in the main
memory as-
Translating Logical Address into Physical Address

● CPU always generates a logical address.


● A physical address is needed to access the main memory.

Following steps are followed to translate logical address into physical address-
Step-01:

CPU generates a logical address consisting of two parts-


● Segment Number specifies the specific segment of the process from which
CPU wants to read the data.
● Segment Offset specifies the specific word in the segment that CPU wants to
read.
Step-02:

● For the generated segment number, corresponding entry is located


in the segment table.
● Then, segment offset is compared with the limit (size) of the
segment.
Now, two cases are possible-
Case-01: Segment Offset >= Limit

● If segment offset is found to be greater than or equal to the limit, a


trap is generated.
Case-02: Segment Offset < Limit

● If segment offset is found to be smaller than the limit, then


request is treated as a valid request.
● The segment offset must always lie in the range [0, limit-1],
● Then, segment offset is added with the base address of the
segment.
● The result obtained after addition is the address of the memory
location storing the required word.
Diagram-

The following diagram illustrates the above steps of translating logical address into physical address-
Advantages-

The advantages of segmentation are-


● It allows to divide the program into modules which provides
better visualization.
● Segment table consumes less space as compared to Page
Table in paging.
● It solves the problem of internal fragmentation.
Disadvantages-

The disadvantages of segmentation are-


● There is an overhead of maintaining a segment table for each process.
● Segments of unequal size are not suited for swapping.
● It suffers from external fragmentation as the free space gets broken down
into smaller pieces with the processes being loaded and removed from the
main memory.

You might also like