Minimizing migrations in fair multiprocessor scheduling of persistent tasks

DOI10.1007/s10951-006-7040-0zbMath1154.90466OpenAlexW3137825794MaRDI QIDQ880554

Baruch Schieber, Tracy Kimbrel, M. I. 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)

Related Items (3)

Inequity averse optimization in operational research ⋮ Sticky-ERfair: a task-processor affinity aware proportional fair scheduler ⋮ Partition oriented frame based fair scheduler

Cites Work

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

This page was built for publication: Minimizing migrations in fair multiprocessor scheduling of persistent tasks