Dining Philosophers

The dining philosophers problem is a classic problem in concurrency:

Five philosophers dine together at the same table. Each philosopher has their own place at the table. There is a fork between each plate. The dish served is a kind of spaghetti which has to be eaten with two forks. Each philosopher can only alternately think and eat. Moreover, a philosopher can only eat their spaghetti when they have both a left and right fork. Thus two forks will only be available when their two nearest neighbors are thinking, not eating. After an individual philosopher finishes eating, they will put down both forks.

You will need a local Cargo installation for this exercise. Copy the code below to a file called src/main.rs, fill out the blanks, and test that cargo run does not deadlock:

  1. use std::sync::{mpsc, Arc, Mutex};
  2. use std::thread;
  3. use std::time::Duration;
  5. struct Fork;
  7. struct Philosopher {
  8.     name: String,
  9.     // left_fork: ...
  10.     // right_fork: ...
  11.     // thoughts: ...
  12. }
  14. impl Philosopher {
  15.     fn think(&self) {
  16.         self.thoughts
  17.             .send(format!("Eureka! {} has a new idea!", &self.name))
  18.             .unwrap();
  19.     }
  21.     fn eat(&self) {
  22.         // Pick up forks...
  23.         println!("{} is eating...", &self.name);
  24.         thread::sleep(Duration::from_millis(10));
  25.     }
  26. }
  28. static PHILOSOPHERS: &[&str] =
  29.     &["Socrates", "Hypatia", "Plato", "Aristotle", "Pythagoras"];
  31. fn main() {
  32.     // Create forks
  34.     // Create philosophers
  36.     // Make each of them think and eat 100 times
  38.     // Output their thoughts
  39. }

You can use the following Cargo.toml:

  1. [package]
  2. name = "dining-philosophers"
  3. version = "0.1.0"
  4. edition = "2021"