A class of allocation strategies inducing bounded delays only

Edsger W. Dijkstra · 1971

We consider a finite set of persons, say numbered from 1 through M, whose never ending life consists of an alternation of eating and thinking, i.e., (in the first instance) they all behave according to the program cycle begin eat; think end.

Read the paper · More papers on PaperTik