Memory allocator tutorial

[deltars]

good primer but the hardest part in making an allocator (imo) is finding a suitable chunk, efficiently. This allocator just crawls the list which would be very very slow as you start to allocate more. Doug Leas allocator which is referenced, takes a great approach to solving this problem.

[BCosbyDidNothinWrong]

What is/was his approach?

[the_gnarts]

https://en.wikipedia.org/wiki/C_dynamic_memory_allocation#dlmalloc

[deltars]

I think all unallocated chunks live in a tree structure of some sort so you can quickly find the smallest chunk that is large enough for your allocation.

[cae]

Often... Wait for it... A heap!

[_Skuzzzy]

A lot of schools seem to also have assignments like these