|
Answer» Paging: It is GENERALLY a memory management technique that allows OS to retrieve processes from secondary storage into main memory. It is a non-contiguous allocation technique that divides each process in the form of pages.
SEGMENTATION: It is generally a memory management technique that divides processes into modules and parts of different SIZES. These parts and modules are known as segments that can be ALLOCATED to process. | Paging | Segmentation |
|---|
| It is invisible to a programmer. | It is visible to a programmer. | | In this, the size of pages is fixed. | In this, the size of segments is not fixed. | | Procedures and data cannot be separated in paging. | Procedures and data can be separated in segmentation. | | It allows a cumulative total of virtual address spaces to cross physical main memory. | It allows all programs, data, and codes to BREAK up into independent address spaces. | | It is mostly available on CPUs and MMU chips. | It is mostly available on Windows servers that may support backward compatibility, while Linux has limited support. | | It is faster for memory access as compared to segmentation. | It is slower as compared to paging. | | In this, OS needs to maintain a free frame. | In this, OS needs to maintain a list of holes in the main memory. | | In paging, the type of fragmentation is internal. | In segmentation, the type of fragmentation is external. | | The size of the page is determined by available memory. | The size of the page is determined by the user. |
|
