Periodic scheduling of marked graphs using balanced binary words
From MaRDI portal
Publication:1758156
DOI10.1016/j.tcs.2012.08.012zbMath1262.68025arXiv1202.4912MaRDI QIDQ1758156
Jean-Vivien Millo, Robert de Simone
Publication date: 8 November 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1202.4912
68M10: Network design and communication in computer systems
68R05: Combinatorics in computer science
68R10: Graph theory (including graph drawing) in computer science
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Cites Work
- A simple characterization of Sturm numbers
- Sturmian words, Lyndon words and trees
- Operations on Christoffel words
- Marked directed graphs
- Balanced sequences and optimal routing
- Un domaine très ouvert : les problèmes d'ordonnancement
- Free Choice Petri Nets
- Abstraction of Clocks in Synchronous Data-Flow Systems
- Unnamed Item
- Unnamed Item
- Unnamed Item