IT, operating systems, maths, and more.
Imagine that you are writing a top-down dynamic algorithm. You already represented your dependencies as recursive functions and now you need to figure out how to decrease the memory usage and calculate things in correct order. On the other hand, you can just apply brute force approach and cache results. How to write caching to … Continue reading Caching result of any function in C++
This is the eleventh part of the .NET Inside Out series. For your convenience you can find other parts in the table of contents in Part 1 – Virtual and non-virtual calls in C# Last time we saw how type markers can result in code optimizations because .NET knows types with structs and can get … Continue reading .NET Inside Out Part 11 — Using structs for devirtualization
This is the thirteenth part of the Custom memory allocation series. For your convenience you can find other parts in the table of contents in Part 1 — Allocating object on a stack Recently Jean-Bernard Pellerin showed nice tricks for binary serialization in place. There is also a description of .NET Framework hack using unions … Continue reading Custom memory allocation in C# Part 13 — In-place serialization
This is the fifty sixth part of the ILP series. For your convenience you can find other parts in the table of contents in Part 1 – Boolean algebra Today we are going to benchmark factorization. First, let’s start with the code: Depending on the size of solver representation (how many bits we use to … Continue reading ILP Part 56 – Factorization benchmarking