Demand paging is identical to the paging system with swapping. In demand paging, a page is delivered into the memory on demand i.e., only when a reference is made to a location on that page. Demand paging combines the feature of simple paging and implement virtual memory as it has a large virtual memory. Lazy swapper concept is implemented in demand paging in which a page is not swapped into the memory unless it is required.
Segmentation is the arrangement of memory management. According to the segmentation the logical address space is a collection of segments. Each segment has a name and length. Each logical address have two quantities segment name and the segment offset, for simplicity we use the segment number in place of segment name.
The difference between Demand Paging and Segmentation are as follows:
|1.||In demand paging, the pages are of equal size.||While in segmentation, segments can be of different size.|
|2.||Page size is fixed in the demand paging.||Segment size may vary in segmentation as it grants dynamic increase of segments.|
|3.||It does not allows sharing of the pages.||While segments can be shared in segmentation.|
|4.||In demand paging, on demand pages are loaded in the memory.||In segmentation, during compilation segments are allocated to the program.|
|5.||Page map table in demand paging manages record of pages in memory.||Segment map table in segmentation demonstrates every segment address in the memory.|
|6.||It provides large virtual memory and have more efficient use of memory.||It provides virtual memory and maximum size of segment is defined by the size of memory.|
Attention reader! Don’t stop learning now. Get hold of all the important CS Theory concepts for SDE interviews with the CS Theory Course at a student-friendly price and become industry ready.