Satiated Philosophers or Concurrent Programming in .NET
Let's take a look at how competitive and parallel programming is structured in .Net, using the example of the dining philosophers problem. The plan is to cover everything from thread/process synchronization to actor models (in subsequent parts). This article may be useful for an initial introduction or to refresh your knowledge. Why should we even know this? Transistors are reaching their minimum size, and Moore's Law is hitting a speed limitation […]
