The document discusses demand paging and segment paging in operating systems. It provides advantages and disadvantages of each approach. Demand paging utilizes memory efficiently and avoids external fragmentation, but has longer memory access times due to interrupts. Segment paging reduces memory usage and page table size, but can cause internal fragmentation. The document also describes how the FIFO and LRU page replacement algorithms work, with FIFO replacing the oldest page and LRU replacing the least recently used page.
The document discusses demand paging and segment paging in operating systems. It provides advantages and disadvantages of each approach. Demand paging utilizes memory efficiently and avoids external fragmentation, but has longer memory access times due to interrupts. Segment paging reduces memory usage and page table size, but can cause internal fragmentation. The document also describes how the FIFO and LRU page replacement algorithms work, with FIFO replacing the oldest page and LRU replacing the least recently used page.
The document discusses demand paging and segment paging in operating systems. It provides advantages and disadvantages of each approach. Demand paging utilizes memory efficiently and avoids external fragmentation, but has longer memory access times due to interrupts. Segment paging reduces memory usage and page table size, but can cause internal fragmentation. The document also describes how the FIFO and LRU page replacement algorithms work, with FIFO replacing the oldest page and LRU replacing the least recently used page.
TANTEEN, ST. GEORGE’S, GRENADA SCHOOL OF APPLIED ARTS & TECHNOLOGY GENERAL EDUCATION DEPARTMENT
Title: Class Activity
Student: Kyle Chetram Program: Computer Systems Technology (CST 1)
Instructor: Christopher Mignon
Course Title: Operating Systems Course Credits: 3 Date: October 17, 2023 Advantages of Demanding Paging With the help of Demand Paging, memory is utilized efficiently.
Demand paging avoids External Fragmentation.
Less Input/Output is needed for Demand Paging.
This process is not constrained by the size of physical memory.
With Demand Paging it becomes easier to share the pages.
With this technique, portions of the process that are never called are never loaded.
No compaction is required in demand Paging.
Disadvantages of Demand Paging
There is an increase in overheads due to interrupts and page tables.
Memory access time in demand paging is longer.
Advantages of Segment Paging
It reduces memory usage. Page table size is limited by the segment size. Segment table has only one entry corresponding to one actual segment. External Fragmentation is not there. It simplifies memory allocation.
Disadvantages of Segment Paging
Internal Fragmentation will be there. The complexity level will be much higher as compared to paging. Page Tables need to be contiguously stored in the memory. How Does the FIFO Paging System Works The easiest page replacement algorithm is this one. With this process, the operating system keeps a queue with the oldest page at the front of the list of all memory pages. When a page must be changed, the first page in the queue is chosen for removal.
How Does the LRU Aging Systems Works
This hypothesis suggested a useful algorithm: whenever a page fault occurs, discard the page which has been idle for the longest period. This method of paging is called LRU (Least Recently Used). The current value of C is stored in the page table entry for the page that was simply referenced after each memory reference.