Minimizing migrations in fair multiprocessor scheduling of persistent tasks
From MaRDI portal
Publication:880554
DOI10.1007/S10951-006-7040-0zbMATH Open1154.90466OpenAlexW3137825794MaRDI QIDQ880554FDOQ880554
Baruch Schieber, Tracy Kimbrel, Maxim Sviridenko
Publication date: 15 May 2007
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-006-7040-0
Recommendations
- Minimizing migrations in fair multiprocessor scheduling of persistent tasks
- scientific article; zbMATH DE number 1305442
- The Power of Migration in Multiprocessor Scheduling of Real-Time Systems
- On the value of job migration in online makespan minimization
- On the value of job migration in online makespan minimization
Cites Work
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
- Proportionate progress: A notion of fairness in resource allocation
- Fair on-line scheduling of a dynamic set of tasks on a single resource
- Dynamic- and static-priority scheduling of recurring real-time tasks
- Guaranteeing Fair Service to Persistent Dependent Tasks
Cited In (6)
- Inequity averse optimization in operational research
- Title not available (Why is that?)
- A corrigendum to: ``Sticky-ERfair: a task-processor affinity aware proportional fair scheduler
- Sticky-ERfair: a task-processor affinity aware proportional fair scheduler
- Guaranteeing Fair Service to Persistent Dependent Tasks
- Partition oriented frame based fair scheduler
This page was built for publication: Minimizing migrations in fair multiprocessor scheduling of persistent tasks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q880554)
