Explore >> Select a destination
|
You are here 
|
maksimkita.com | ||
| | | | |
clickhouse.com
|
|
| | | | | Dive into the internals of how we optimize ClickHouse for specific architectures and instruction sets with our CPU-dispatch framework | |
| | | | |
www.bazhenov.me
|
|
| | | | | Introduction Link to heading Varint is a widely recognized technique used for compressing integer streams. Essentially, it suggests that it can be more efficient to encode a number using a variable-length representation instead of a fixed-size binary representation. By removing leading zeros from the binary number, the overall representation size can be reduced. This technique works particularly well for encoding smaller numbers. In this article, I provide a brief introduction and rationale for varint encoding. Additionally, I describe the Stream VByte format, which enables fully vectorized decoding through SSSE3 instructions. I also share my findings from implementing this algorithm in Rust, which includes both encoding and decoding primitives and the abili... | |
| | | | |
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. | |
| | | | |
code.dblock.org
|
|
| | | [AI summary] The author shares their experience joining AWS, highlighting the positive candidate experience and the opportunity to learn at a large-scale, fast-growing company, along with tips for interviewing as a principal engineer. | ||
