heap

There is one post tagged heap.

Writing a Memory Allocator

  1. Video lecture
  2. Mutator, Allocator, Collector
  3. Memory block
  4. Allocator interface
  5. Memory alignment
  6. Memory mapping
  7. Freeing the objects
  8. Blocks reuse
  9. First-fit search
  10. Assignments
    1. Next-fit search
    2. Best-fit search
    3. Blocks splitting
    4. Blocks coalescing
    5. Explicit Free-list
    6. Segregated-list search
    7. Optimizing the storage
    8. Custom sbrk
  11. Conclusion

This is the 6th lecture from the Garbage Collection Algorithms class, devoted to the automatic memory management.

Before discussing algorithms of collecting the garbage, we need to see how these objects (which eventually become a garbage) are allocated on the heap. In today’s lecture we consider mechanisms of memory allocation.

Continue reading →