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