Optimal allocation sequences of two processes sharing a resource
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.
- Generalized balances in Sturmian words
- On balanced and abelian properties of circular words over a ternary alphabet
- Asymptotic height optimization for topical IFS, Tetris heaps, and the finiteness conjecture
- scientific article; zbMATH DE number 3970497 (Why is no real title available?)
- scientific article; zbMATH DE number 744092 (Why is no real title available?)
- Second Order Balance Property on Christoffel Words
- Asymptotic behavior in a heap model with two pieces
- Allocation of jobs and identical resources with two pooling centers
This page was built for publication: Optimal allocation sequences of two processes sharing a resource
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1372908)
