Optimal allocation sequences of two processes sharing a resource

DOI10.1023/A:1008256825451zbMath0909.68135OpenAlexW1581077724MaRDI QIDQ1372908

Bruno Gaujal

Publication date: 30 March 1999

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008256825451

zbMATH Keywords

resource allocationmost regular wordsprocesses sharing a common resource

Mathematics Subject Classification ID

Combinatorics on words (68R15) Special sequences and polynomials (11B83)

Related Items (5)

Generalized balances in Sturmian words ⋮ Asymptotic height optimization for topical IFS, Tetris heaps, and the finiteness conjecture ⋮ Asymptotic behavior in a heap model with two pieces ⋮ On balanced and abelian properties of circular words over a ternary alphabet ⋮ Second Order Balance Property on Christoffel Words

This page was built for publication: Optimal allocation sequences of two processes sharing a resource