Skip to content
All tags

#malloc

2 posts
learning deep-dive Reading Stanford CS107

Stanford CS107 Lecture 21: A First Heap Allocator and the Tension Between Speed and Space

CS107 Lecture 21 starts with alignment, throughput, and utilization, then uses a bump allocator and an implicit free list to explain metadata, splitting, placement, internal and external fragmentation, and the need to coalesce freed blocks.

#cs107#stanford#systems-programming#memory-management#malloc#heap
learning deep-dive Reading Stanford CS107

Stanford CS107 Lecture 22: Why an Explicit Free List Lives in Two Orders at Once

CS107 Lecture 22 replaces an implicit list with an explicit free list. Searches visit only reusable blocks, but every free block now has both physical neighbors and logical links, so unlinking, coalescing, and reinsertion must preserve both structures.

#cs107#stanford#systems-programming#memory-management#malloc#free-list