Quantitatively fair scheduling

DOI10.1016/J.TCS.2011.06.029MaRDI QIDQ764298zbMATH OpenOpenAlexFDO

Authors Alessandro Bianco, Marco Faella, Fabio Mogavero, Aniello Murano

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

edge-colored graphsfairnessgamelinear programmingpolynomial algorithmscheduling

Mathematics Subject Classification ID

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) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Quantitative fairness games
• Balanced Paths in Colored Graphs
• scientific article; zbMATH DE number 4185038
• Guaranteeing Fair Service to Persistent Dependent Tasks
• Publication:4886054

Cites work

• Balanced Paths in Colored Graphs
• Bounded fairness
• Half-Positional Determinacy of Infinite Games
• scientific article; zbMATH DE number 3972158 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3735115 (Why is no real title available?)
• scientific article; zbMATH DE number 52331 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Infinite games played on finite graphs
• Introduction to algorithms
• Module checking
• On Context-Free Languages
• On the synthesis of strategies in infinite games
• Tools and Algorithms for the Construction and Analysis of Systems

Cited in

(11)

• Resource-sharing system scheduling and circular chromatic number
• Proportionate progress: A notion of fairness in resource allocation
• Fair Hitting Sequence Problem: scheduling activities with varied frequency requirements
• Balanced Paths in Colored Graphs
• scientific article; zbMATH DE number 3901999 (Why is no real title available?)
• Quantitative fairness games
• Explicit fair scheduling for dynamic control
• Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service
• scientific article; zbMATH DE number 4185038 (Why is no real title available?)
• Quantitative aspects of programming languages and systems over the past 2⁴ years and beyond
• Smooth scheduling under variable rates or the analog-digital confinement game

This page was built for publication: Quantitatively fair scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q764298)