Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
BobbyTables2
on July 13, 2024
|
parent
|
context
|
favorite
| on:
Beating the L1 cache with value speculation (2021)
The example is slightly contrived (the entire linked list was preallocated), but seems like the same technique could be a useful performance optimization, such as if successive calls to malloc commonly return pointers with a particular stride.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: