Part 0: Writing a memory allocator - v0 Part 1: Writing a memory allocator - v1 An optimization of free() using boundary tags Last week, I was concerned about the performance of the coalescing algori…

Part zero: Writing a memory allocator - v0 In v0, we made the simplifying assumption that all the data we work with are fixed-size blocks. Now, we're going to relax the assumption: data can now be re…

For the next couple weeks, we're going to write a memory allocator. I'm dumb, so I need to start from dead-simple problem constraints and work my way up to increasingly complex constraints. As such, …

Part I: How expensive are cache misses? - I Last week, I asked How expensive are cache misses? - I - and ran into a small problem with the granularity of my measurement tool. Apparently, on my 2025 M…

"Cache miss" is a buzzword that I've heard tossed around in low latency applications - but I'm wondering how expensive cache misses actually are. I've seen numbers like this online: L1 cache referenc…