IT, operating systems, maths, and more.
This is the ninth 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 Last time we implemented custom mutex based on memory mapped files. We can use it to track who owns the lock in much simpler way. … Continue reading Concurrency Part 9 — Semaphores with custom locks
This is the eighth 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 We know how to use global mutexes to synchronize processes. However, there is a big drawback — we don’t know who owns the mutex and … Continue reading Concurrency Part 8 — Tracking mutex owner
This is the seventh 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 Last time we examined an interesting behavior of Mutex when it is abandoned. Today we will look into Semaphore. Typical interview question is: what is … Continue reading Concurrency Part 7 — Semaphores trickery
Today very simple trick to capture whole output from Powershell. Let’s see those files: 1.ps1 2.ps1 3.bat 4.vbs 5.exe 6.exe Let’s now run this with powershell: Okay, we have all STD OUT and STD ERR streams. Let’s now try redirecting this to file: File content: Okay, so standard output was redirected correctly but standard error … Continue reading Capturing all output in Powershell
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++