This is part 3 of a 3-part series where we solve the Dining Philosophers concurrency problem using just UNIX, systemd and some bash scripting! In part 2 we created multiple philosophers using separate user ids, got them to take their seat in the dining room and even pick up their initial forks1. Now we need to implement the core part of the dining philosopher’s problem - the conflict resolution layer - and that means we need an appropriate algorithm. We’ll be using a variant of the Chandry/Misra...