Module 20 - OS: Heap Allocators 2 (Shah) - 2025-Oct-29
Overview
In this module we continue discussing memory allocators.
- Dynamic Memory Allocation
- Internal and External Fragmentation
- First-fit, next-fit, and best-fit
- Local and Global Allocators
Slides and Class Content
- Direct Link to Slideset 1
- Sorry, more than 7 days have passed, I suggest setting a calendar reminder!
- Public Github Repository for the course
Please note: Your in-class activity is graded. Your first attempt will be graded. You can use your notes and slides if you like. You have 1 week from the date of this module opening to complete the in-class activity. In-class activities are completed individually.
Audio/Video Recording
Note: Audio/Video recordings are made in a best effort in case you have to miss class or you would otherwise like to re-watch a portion of lecture. Occassional recording errors (e.g. missing sound, corrupted video, etc.) may occur, and I apologize in advance if a recording is not able to be made available.
Readings
- code::dive 2017 – John Lakos – Local (“arena”) memory allocator
- Nice talk with benchmarks and also connects caching with allocators
- DConf 2019 Day 1 Keynote: Allocating Memory with the D Programming Language -- Walter Bright
- Discusses many trade-offs of different memory allocation strategies. Video and slides here: https://dconf.org/2019/talks/bright.html
- DConf '23 -- Stack Memory is Awesome! -- Dennis Korpel
- Implementation of arena allocators
- DConf '24 | Avoid the GC in 80 Lines | Dennis Korpel
- D perspective of multiple management styles
Please use the following resources to supplement this lecture. You may choose to read 1 or more of these before/during/after the lecture to fully immerse into the material.