In this project, you will learn about Memory management. This project requires you to construct and compare a few memory allocation/deallocation schemes and compare them.

Your memory management subsystem will be based on the following systems: First Fit, Best Fit, Worst Fit and Buddy system. It will provide the user with an interface for making memory requests and also for freeing up memory that is no longer needed by the user. One of the jobs of the memory management subsystem is to service memory requests by matching the size of the request with a large enough hole, from which to satisfy the request. Specifically in the Buddy system you have buckets, whose size in bytes is a power of 2. When you get the request you will allocate a bucket with a size greater than the memory chunk that is requested.

NOTE:

The size parameter is given only in my_malloc and not in my_free. However it is necessary to know the size of what is being freed. The way it is usually handled is that each allocated memory block has a header inside it. It stores the size of the block  (as an integer). When a block is to be allocated in the my_malloc a pointer to the byte after the header of that block is returned. The header will be used when the user calls my_free to return the block to the proper list in the free bucket pool. If possible, freed memory should be merged together to give a hole of a larger size.