We investigate how to make faster hash maps, trees, linked lists and vector of pointers by changing their data layout.
All posts tagged tree
Instruction-level parallelism in practice: speeding up memory-bound programs with low ILP
We talk about instruction level parallelism: what instruction-level parallelism is, why is it important for your code’s performance and how you can add instruction-level parallelism to improve the performance of your memory-bound program.