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
Non-contiguous Memory Allocation
Introduction: Non-contiguous Memory Allocation
As we know at dynamic memory allocation still has external fragmentation due to contiguous memory allocation so, one of the solutions to this problem is to use non-contiguous memory allocation.
#According to the free random hole created at the memory, so, it is difficult to break the process into different sizes. That’s why here breaks the process into the same equal partition and memory partition also according to the partition of process.
Every partition of the process is called a page and the partition of the memory called a frame because pages fit in the frames. Page size and frame size must be equal.
Frames (Physical address page): A frame is a unit of physical memory. Actually, physical memory space is divided into blocks of the same size which is called frames.
Pages (Logical or virtual address page): A process is divided into some units with the same size is called a page. Every process has logical memory and logical memory is divided into blocks of the same size is called pages.
Let a process with size 40MB and main memory is 160MB. Now we divided the pages in equal size which divided 5 pages with each size 8MB. As we know page size and memory frame size is the same so, also divided the memory into 20 frames with size 8MB.
.png)
