Minimizing migrations in fair multiprocessor scheduling of persistent tasks
- 1 August 2006
- journal article
- Published by Springer Nature in Journal of Scheduling
- Vol. 9 (4) , 365-379
- https://doi.org/10.1007/s10951-006-7040-0
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Multiprocessor fixed-priority scheduling with restricted interprocessor migrationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Dynamic- and Static-priority Scheduling of Recurring Real-time TasksReal-Time Systems, 2003
- Fast scheduling of periodic tasks on multiple resourcesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Deadline fair scheduling: bridging the theory and practice of proportionate pair scheduling in multiprocessor systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Scheduling periodic tasks on uniform multiprocessorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Borrowed-virtual-time (BVT) schedulingPublished by Association for Computing Machinery (ACM) ,1999
- Guaranteeing Fair Service to Persistent Dependent TasksSIAM Journal on Computing, 1998
- Fair on-line scheduling of a dynamic set of tasks on a single resourceInformation Processing Letters, 1997
- CPU reservations and time constraintsPublished by Association for Computing Machinery (ACM) ,1997
- Proportionate progress: A notion of fairness in resource allocationAlgorithmica, 1996