5.1kviews Which algorithm makes the most efficient use of memory? Also discuss partition selection algorithm in brief. Given memory partition of 150k, 500k, 200k, 300k &550k (in order). How would each pf the first fit , best fit and worst fit algorithm place the processes of 220k, 430k, 110k &425k (in order). ADD COMMENTEDIT 1 Answerwritten 6.7 years ago by 
priyad84 • 350modified 2.6 years agoby 
binitamayekar ★ 6.5k
472views Given Memory Partition = 150 KB, 500 KB, 200 KB, 300 KB, and 550 KB (in order), how would each algorithm place processes of size 220 KB, 430 KB, 110 KB & 425 KB (in order)? In the first fit, a partition is allocated which is first sufficient from the top of Main Memory. Fastest algorithm because it searches as little as possible. The remaining unused memory areas left after allocation become waste if it is too smaller. Thus request for a larger memory requirement cannot be accomplished. Allocate the process to the partition which is the first smallest sufficient partition among the free available partition. Memory utilization is much better than the first fit as it searches the smallest free partition first available. It is slower and may even tend to fill up memory with tiny useless holes. Allocate the process to the partition which is largest sufficient among the freely available partitions available in the main memory. Reduces the rate of production of small gaps. If a process requiring larger memory arrives at a later stage then it cannot be accommodated as the largest hole is already split and occupied. In this problem, the Best-Fit Algorithm makes the most efficient use of memory because it was the only algorithm that meet all the memory requests. ADD COMMENTEDITwritten 2.6 years ago by binitamayekar ★ 6.5kMEMORY ALLOCATION ALGORITHMS
First Fit:
Best-fit:
Worst-fit:
Please log in to add an answer.
