This disclosure relates to the field of Dynamic memory management in general. Disclosed idea makes use of the
Best fit approach which makes use of the balanced trees with nodes sorted based on key values corresponding to
free memory portion sizes. Also disclosed is the method to efficiently coalesce the freed memory.
This idea addresses the disadvantages of sequential search mechanism of finding the available free space and firstfit
approach of memory management in the current flat memory-based allocators that are based on  approach.
The current mechanism for dynamic memory management in use in most of the systems follows a sequential search
for all the operations, this leads to a worst-case time complexity of O(N) and it follows the first-fit approach to
allocate the first available free space for any request which leads to fragmentation issues.
Creative Commons License
This work is licensed under a Creative Commons Attribution-Share Alike 4.0 License.
INC, HP, "DYNAMIC MEMORY MANAGEMENT WITH REDUCED FRAGMENTATION USING THE BEST-FIT APPROACH", Technical Disclosure Commons, (December 21, 2020)