Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
kevin_thibedeau
on July 12, 2024
|
parent
|
context
|
favorite
| on:
Beating the L1 cache with value speculation (2021)
Memory pools are commonly allocated in a contiguous block and sliced into nodes placed onto a free list. They will be sequential until the pattern of allocations mixes them up.
kazinator
on July 12, 2024
[–]
Garbage collection is good at consolidating swaths of adjacent free objects into ordered allocation.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: