FIXED PARTITIONING
Using fixed partitioning we are able to allocate the memory Here we are dividing the memory into a few fixed partitions.Every partition may not be of the size For every partition we have an input queue If we have a process enters Analyze the process as well as choose the smallest partition in the memory for that to be properly fitted. That is the smallest portion in the memory which can fit that process in it properly.
The following illustrate the partition in a system.If an 8k process comes it goes to the 10k space it is the smallest but finest fit for 8k.
Here is depletion of 2k memory. Here if we enter merely small process and if only small processes are enter the big partitions will be wasted .thus we can use a queue which are able to decide which process is to be entered at which memory space. The queue will send the largest space but small enough to hold the process entered.