CREATE OWN LIBRARY
- Introduction: OS
- Booting Process
- Command Interpreter
- Dual mode of operation
- System Calls
- Difference between system call and library call
- Interrupt and Trap
- Introduction
- Scheduling Criteria, Terms and Concepts
- Different Type Scheduling Algorithms
- Longest Job First
- Longest Remaining Time First
- Highest Response Ratio Next (HRRN)
- Priority Scheduling
- Least Completed Next (LCN) Scheduling
- Multi-Level Queue Scheduling
- Multilevel Feedback Queue Scheduling
- Guaranteed Scheduling
- Fair Share Scheduling
- Lottery Scheduling
- Multi-Processor Scheduling
- Deadline Scheduling
- Rate-Monotonic Scheduling
- POSIX Real-Time Scheduling
- Priority Inversion
- Proportional Share Scheduling
- Comparison table of Scheduling Algorithm
- Algorithm Evaluation for Scheduling
- Important concept of MM
- Memory Representation as Address
- Memory layout for a Process
- Logical and Physical Address Space
- Necessity of Memory Management
- Introduction
- Concept of Non-contiguous memory allocation
- Basic concept of Paging
- Address Translation
- Process of Paging Method
- Calculation of Offset for paging
- Calculation of Logical Address Bit and number of Pages
- Calculation of Physical Address Bit and number of Frames
- Calculation of Page Table Size
- Organization of MMU
- Why Page size power of 2
- Paging Address Calculation: example1
- Paging Numeric Problem: Example2
- Paging Address Calculation: Example3
- Paging Address Calculation: Question1
- Some Important Question 2
- Paging Address Translation: Question3
- UGC NET Paging Question
- GATE Paging Question
- Number of information at Page Entry
- Exams Question on Page Entry Information
- Exam Question: Page Entry Information
- Calculates Page Table Entry Size
- Calculates Page Size
- Calculation of Optimal Page Size
- Question on Optimal Page Size
- Hashed Page Table with Example
- Inverted Page Table with Gate Question
- Question on Inverted Page Table
- Multi-Level Paging
- Multi-level paging: Example1
- Multi-level paging: Example2
- Allocation of Frames
- Subject Mock
Comparison of the page replacement algorithm
Summary of page replacement algorithms
| Algorithm | Comments |
| Optimal | Give optimal solution, but not implementable, use as a benchmark. |
| Least Recently Used (LRU) | Efficient, but it is difficult to implement exactly. |
| Most Recently Used (MRU) | Not efficient for all types of processes. |
| FIFO (First-In, First-Out) | Might replace important page (most recently and frequently used page). |
| Second chance | Good modification of FIFO and better performance. |
| Clock Replacement algorithm | Second Chance with Circular list; efficient data structure and realistic. |
| Not Recently Used (NRU) | Very basic approximation of LRU. |
| Least Frequently Used (LFU) | A fairly crude approximation of LRU, expensive to implement. |
| Working Set | Somewhat expensive to implement. |
| WSClock | Most efficient algorithm. |
| Aging | Efficient algorithm that approximates LRU well. |
All in all, the two best algorithms are aging and WSClock. They are based on LRU and the working set, respectively. Both give good paging performance and can be implemented efficiently.
A few other good algorithms exist, but these two are probably the most important in practice.
