Packet delay under the golden ratio weighted tdm policy in a multiple-access channel
IEEE Transactions on Information Theory
Automata on Infinite Words, Ecole de Printemps d'Informatique Théorique,
Balanced sequences and optimal routing
Journal of the ACM (JACM)
Asymptotic behavior in a heap model with two pieces
Theoretical Computer Science
Regular Ordering and Applications in Control Policies
Discrete Event Dynamic Systems
Generalized balances in Sturmian words
Discrete Applied Mathematics
SCHEDULING OF AN INPUT-QUEUED SWITCH TO ACHIEVE MAXIMAL THROUGHPUT
Probability in the Engineering and Informational Sciences
| Hi-index | 0.00 |
In this paper, we show that the “most regular” wordin the language formed by all the words containing a fixed numberof each letter of an alphabet gives the optimal resource allocationpolicy of the generic system composed by two processes sharinga resource. This system will be modeled as a Petri net to derivethe proof of this result which is partially generalized to nonperiodic allocation sequences and non rational frequencies. ForN processes sharing a resource, we show that a stronglyoptimal sequence may not exist. In this case, we give an heuristicto find a good allocation sequence which relates to regular wordsin higher dimensions.