- Large virtual memory.
- More efficient use of memory.
- Unconstrained multiprogramming. There is no limit on degree of multiprogramming.
- Number of tables and amount of processor overhead for handling page interrupts are greater than in the case of the simple paged management techniques.
- Due to lack of an explicit constraint on a job’s address space size.
A way to control Thrashing
Set the lower and upper bounds of page fault rate for each process. Using the above step, establish ‘acceptable’ page fault rate.
- If actual rate is lower than lower bound, decrease the number of frames
- If actual rate is larger than upper bound, increase the number of frames.
Q1. Virtual memory is
(a) Large secondary memory
(b) Large main memory
(c) Illusion of large main memory
(d) None of the above
Explanation: Virtual memory is illusion of large main memory.
Q2. Thrashing occurs when
(a)When a page fault occurs
(b) Processes on system frequently access pages not memory
(c) Processes on system are in running state
(d) Processes on system are in waiting state
Explanation: Thrashing occurs when processes on system require more memory than it has. If processes do not have “enough” pages, the page fault rate is very high. This leads to:
– low CPU utilization
– operating system spends most of its time swapping to disk
The above situation is called thrashing
Q3. A computer system supports 32-bit virtual addresses as well as 32-bit physical addresses. Since the virtual address space is of the same size as the physical address space, the operating system designers decide to get rid of the virtual memory entirely. Which one of the following is true?
(a) Efficient implementation of multi-user support is no longer possible
(b) The processor cache organization can be made more efficient now
(c) Hardware support for memory management is no longer needed
(d) CPU scheduling can be made more efficient now
Explanation: For supporting virtual memory, special hardware support is needed from Memory Management Unit. Since operating system designers decide to get rid of the virtual memory entirely, hardware support for memory management is no longer needed.
This article is contributed by Mithlesh Upadhyay
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.
- Difference between Virtual memory and Cache memory
- Virtual Memory in Operating System
- Difference between Volatile Memory and Non-Volatile Memory
- Random Access Memory (RAM) and Read Only Memory (ROM)
- Introduction to memory and memory units
- Mapping Virtual Addresses to Physical Addresses
- Virtual Machines in Operating System
- Difference between Virtual Machines and Containers
- Types of Virtual Machines
- Peterson's Algorithm for Mutual Exclusion | Set 2 (CPU Cycles and Memory Fence)
- Partition Allocation Methods in Memory Management
- Cache Memory in Computer Organization
- Operating Systems | Memory Management | Question 1
- Different Types of RAM (Random Access Memory )
- Tracing memory usage in Linux
- Program for Next Fit algorithm in Memory Management
- Overlays in Memory Management
- Buddy System - Memory allocation technique
- IPC through shared memory
- Allocating kernel memory (buddy system and slab system)