I'm new in Golang and haven't done concurrency in a bit. I would love to hear your opinion on my Dining problem Go solution. Description here, with a tl;dr below:

Five silent philosophers sit at a round table with bowls of spaghetti. Forks are placed between each pair of adjacent philosophers.

Each philosopher must alternately think and eat. However, a philosopher can only eat spaghetti when they have both left and right forks. Each fork can be held by only one philosopher and so a philosopher can use the fork only if it is not being used by another philosopher. After an individual philosopher finishes eating, they need to put down both forks so that the forks become available to others. A philosopher can only take the fork on their right or the one on their left as they become available and they cannot start eating before getting both forks.

Eating is not limited by the remaining amounts of spaghetti or stomach space; an infinite supply and an infinite demand are assumed.

The problem is how to design a discipline of behavior (a concurrent algorithm) such that no philosopher will starve; i.e., each can forever continue to alternate between eating and thinking, assuming that no philosopher can know when others may want to eat or think.

package main

import "fmt"
import "sync"
import "time"

const NumPhilosophers = 5
var phi [NumPhilosophers]int
var forks [NumPhilosophers]sync.Mutex

func startPhilosopher(number int, c chan string){
    left, right := (number+1)%NumPhilosophers, number
    min, max := left,right
    if min > max {
        min, max = max, min

    for i := 0; i < 4; i++ {
        c <-"Thinking " + time.Now().Round(0).String()

        c <- "Eating " + time.Now().Round(0).String()


func main() {
    var ch [NumPhilosophers]chan string
    for i := 0; i < NumPhilosophers; i++ {
        phi[i] = i
        ch[i] = make(chan string)
        go startPhilosopher(i, ch[i])

    for a := 0; a < NumPhilosophers; a++ {
        for i := range ch[a] {

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.