Guaranteeing Fair Service to Persistent Dependent Tasks
From MaRDI portal
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Deterministic scheduling theory in operations research (90B35) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)
Recommendations
- Publication:4886054
- Minimizing migrations in fair multiprocessor scheduling of persistent tasks
- Minimizing migrations in fair multiprocessor scheduling of persistent tasks
- Fair on-line scheduling of a dynamic set of tasks on a single resource
- A fair workload allocation policy for heterogeneous systems
- Promptness and bounded fairness in concurrent and parameterized systems
- Guaranteeing response times for aperiodic tasks in global multiprocessor scheduling
- Fairness in parallel job scheduling
- scientific article; zbMATH DE number 1717243
Cited in
(8)- Scheduling algorithms for conducting conflict-free measurements in overlay networks
- On Scheduling Policies for Streams of Structured Jobs
- scientific article; zbMATH DE number 871903 (Why is no real title available?)
- scientific article; zbMATH DE number 910880 (Why is no real title available?)
- On centralized smooth scheduling
- Quantitatively fair scheduling
- Minimizing migrations in fair multiprocessor scheduling of persistent tasks
- Probabilistic analysis for scheduling with conflicts
This page was built for publication: Guaranteeing Fair Service to Persistent Dependent Tasks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4210089)
