Guaranteeing Fair Service to Persistent Dependent Tasks
From MaRDI portal
Publication:4210089
DOI10.1137/S0097539795282092zbMath0910.90174MaRDI QIDQ4210089
Madhu Sudan, Baruch Schieber, Amotz Bar-Noy, Alain J. Mayer
Publication date: 20 September 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
90C60: Abstract computational complexity for mathematical programming problems
90B35: Deterministic scheduling theory in operations research
68W10: Parallel algorithms in computer science
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
On centralized smooth scheduling, Minimizing migrations in fair multiprocessor scheduling of persistent tasks, Probabilistic analysis for scheduling with conflicts