Minimizing migrations in fair multiprocessor scheduling of persistent tasks

DOI10.1007/S10951-006-7040-0MaRDI QIDQ880554zbMATH OpenOpenAlexFDO

Authors Tracy Kimbrel, Baruch Schieber, 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

zbMATH Keywords

Multiprocessor schedulingFair schedulingPersistent tasksProcess migration

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

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

Cites work

• Dynamic- and static-priority scheduling of recurring real-time tasks
• Fair on-line scheduling of a dynamic set of tasks on a single resource
• Guaranteeing Fair Service to Persistent Dependent Tasks
• Proportionate progress: A notion of fairness in resource allocation
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Cited in

(7)

• Minimizing migrations in fair multiprocessor scheduling of persistent tasks
• Partition oriented frame based fair scheduler
• Inequity averse optimization in operational research
• 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
• scientific article; zbMATH DE number 910880 (Why is no real title available?)

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)