Optimal allocation sequences of two processes sharing a resource

DOI10.1023/A:1008256825451zbMATH Open0909.68135OpenAlexW1581077724MaRDI QIDQ1372908FDOQ1372908

Authors: 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

Recommendations

• scientific article; zbMATH DE number 744092
• Decomposition of uniform resource allocation problems
• \(m\)-balanced words: A generalization of balanced words
• Balanced sequences and optimal routing

zbMATH Keywords

resource allocationmost regular wordsprocesses sharing a common resource

Mathematics Subject Classification ID

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

Cited In (8)

• On balanced and abelian properties of circular words over a ternary alphabet
• Generalized balances in Sturmian words
• Asymptotic behavior in a heap model with two pieces
• Title not available (Why is that?)
• Second Order Balance Property on Christoffel Words
• Allocation of jobs and identical resources with two pooling centers
• Asymptotic height optimization for topical IFS, Tetris heaps, and the finiteness conjecture
• Title not available (Why is that?)

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)