Optimal allocation sequences of two processes sharing a resource (Q1372908)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1083031
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal allocation sequences of two processes sharing a resource |
scientific article; zbMATH DE number 1083031 |
Statements
Optimal allocation sequences of two processes sharing a resource (English)
0 references
30 March 1999
0 references
The author shows the relevance of the ``most regular words'' in the study of two processes sharing a common resource, with an external constraint on the system frequency. These words essentialy correspond to drawing a discrete straight line through the origin in the plane: they are composed with vertical and horizontal unit segments; hence they are either periodic or Sturmian characteristic words (the second case corresponds to irrational slopes). Properties of these words and applications to the initial problem are given. Some results are sketched for more than two processes, i.e., for ``most regular words'' on an alphabet with at least three letters.
0 references
resource allocation
0 references
most regular words
0 references
processes sharing a common resource
0 references
0.6922413110733032
0 references
0.690462052822113
0 references
0.6895105838775635
0 references
