Quantitatively fair scheduling

DOI10.1016/j.tcs.2011.06.029zbMath1243.68099OpenAlexW2130446660MaRDI QIDQ764298

Fabio Mogavero, Aniello Murano, Alessandro Bianco, Marco Faella

Publication date: 13 March 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.06.029

zbMATH Keywords

fairnesslinear programmingschedulingpolynomial algorithmgameedge-colored graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Infinite games played on finite graphs
• Module checking
• Balanced Paths in Colored Graphs
• Half-Positional Determinacy of Infinite Games
• On the synthesis of strategies in infinite games
• Verification: Theory and Practice
• On Context-Free Languages
• Tools and Algorithms for the Construction and Analysis of Systems

This page was built for publication: Quantitatively fair scheduling