1. Fixed Partitioning :
Multi-programming with fixed partitioning is a contiguous memory management technique in which the main memory is divided into fixed sized partitions which can be of equal or unequal size. Whenever we have to allocate a process memory then a free partition that is big enough to hold the process is found. Then the memory is allocated to the process.If there is no free space available then the process waits in the queue to be allocated memory. It is one of the most oldest memory management technique which is easy to implement.
2. Variable Partitioning :
Multi-programming with variable partitioning is a contiguous memory management technique in which the main memory is not divided into partitions and the process is allocated a chunk of free memory that is big enough for it to fit. The space which is left is considered as the free space which can be further used by other processes. It also provides the concept of compaction. In compaction the spaces that are free and the spaces which not allocated to the process are combined and single large memory space is made.
Difference between Fixed Partitioning and Variable Partitioning :
|S.NO.||Fixed partitioning||Variable partitioning|
|1.||In multi-programming with fixed partitioning the main memory is divided into fixed sized partitions.||In multi-programming with variable partitioning the main memory is not divided into fixed sized partitions.|
|2.||Only one process can be placed in a partition.||In variable partitioning, the process is allocated a chunk of free memory.|
|3.||It does not utilize the main memory effectively.||It utilizes the main memory effictively.|
|4.||There is presence of internal fragmentation and external fragmentation.||There is external fragmentation.|
|5.||Degree of multi-programming is less.||Degree of multi-programming is higher.|
|6.||It is more easier to implement.||It is less easier to implement.|
|7.||There is limitation on size of process.||There is no limitation on size of process.|
Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.
- Fixed (or static) Partitioning in Operating System
- Variable (or dynamic) Partitioning in Operating System
- Fixed Length and Variable Length Subnet Mask Numericals
- Difference between Fixed and Dynamic Channel Allocations
- Internal static variable vs. External static variable with Examples in C
- Fixed and Flooding Routing algorithms
- Fixed-priority pre-emptive scheduling
- 5 variable K-Map in Digital Logic
- Lock Variable Synchronization Mechanism
- Variable Entrant Map (VEM) in Digital Logic
- Introduction of Variable Length Subnet Mask (VLSM)
- Difference between DAS and NAS
- Difference between C and C++
- Difference between IoE and IoT
- Difference between ++*p, *p++ and *++p
- Difference between CD and DVD
- Difference between C and C#
- Difference between 4G and 5G
- Difference between LED and LCD
- Difference between PNG and GIF
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.