IT, operating systems, maths, and more.
This is the fiftieth 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 solve three graph problems: vinimum spanning tree, vertex cover and edge cover. Helpers Let’s start with some helper code: Data structures for … Continue reading ILP Part 50 — MST, vertex cover and edge cover
This is the eighth 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 Today we are going to revisit an Unsafe list example using .NET Core. Since I use x64 edition, I need to adjust … Continue reading Custom memory allocation in C# Part 8 — Unsafe list in .NET Core x64
Can one line of code in C# JIT compile into two different blocks of code in the same program? This sounds a little tricky but in fact is very easy and happens pretty often. Consider the following code: Now let’s see the loop in the machine code: You can see that C:\Users\user\Reordering\Program.cs @ 9: appears … Continue reading Reordered code after compilation
This is the seventh 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 We know how to allocate object on a stack, however, we did this in .NET Framework. Can we do the same in … Continue reading Custom memory allocation in C# Part 7 — Stack allocation once again
This is the sixth part of the Concurrency series. For your convenience you can find other parts in the table of contents in Part 1 – Mutex performance in .NET Let’s start with the following code: We want to acquire a mutex. Since the operation might fail, we want to log the timeout, handle the … Continue reading Concurrency Part 6 – Abandoned mutex