A class of allocation strategies inducing bounded delays only

  • Authors:
  • Edsger W. Dijkstra

  • Affiliations:
  • Technological University, Eindhoven, The Netherlands

  • Venue:
  • AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
  • Year:
  • 1971

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.