Explore >> Select a destination
|
You are here 
|
mklimenko.github.io | ||
| | | | |
maksimkita.com
|
|
| | | | | [AI summary] This post explains how to use runtime CPU dispatch and compiler vectorization to optimize code performance using modern CPU instruction sets like AVX2 and AVX512, including a detailed look at the implementation and results within the ClickHouse database. | |
| | | | |
thasso.xyz
|
|
| | | | | My personal blog about things I find interesting. Hit me up! | |
| | | | |
clickhouse.com
|
|
| | | | | Dive into the internals of how we optimize ClickHouse for specific architectures and instruction sets with our CPU-dispatch framework | |
| | | | |
bayesianneuron.com
|
|
| | | [AI summary] The user has shared a detailed exploration of optimizing the 0/1 Knapsack problem using dynamic programming with Python and NumPy. They discuss various optimization techniques, including reducing memory usage with a 2-row approach, vectorization using NumPy's `np.where` for faster computation, and the performance improvements achieved. The final implementation shows significant speedups, especially for large-scale problems, and the user highlights the importance of vectorization and efficient memory management in computational tasks. | ||
