Concept of segmentation in OS

                 Segmentation :-

A process is divided into Segments. The chunks that a program is divided into which are not necessarily all of the same sizes are called segments. Segmentation gives user’s view of the process which paging does not give. Here the user’s view is mapped to physical memory.
There are types of segmentation:
  1. virtual memory segmentation
 process is divided into a number of segments, not all of which are resident at any one point in time.
2 .Simple segmentation –

Each process is divided into a number of segments, all of which are loaded into memory at run time, though not necessarily contiguously.

There is no simple relationship between logical addresses and physical addresses in segmentation. A table stores the information about all such segments and is called Segment Table.
Segment Table – It maps two-dimensional Logical address into one-dimensional Physical address. It’s each table entry has:
  • Base Address: It contains the starting physical address where the segments reside in memory.
  • Limit: It specifies the length of the segment.

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-
  1. Segment Number
  2. Segment Offset


  • 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-


Address generated by the CPU is divided into:
  • Segment number (s): Number of bits required to represent the segment.
  • Segment offset (d): Number of bits required to represent the size of the segment.

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.
  • The time taken to fetch the instruction increases since now two memory accesses are required.
  • 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.



Comments

Popular posts from this blog

Introduction of Digital computer

INTRODUCTION OF DBMS

Introduction to cache memory