Multiprocessor real-time scheduling with arbitrary processor affinities: from practice to theory
- 30 July 2014
- journal article
- Published by Springer Nature in Real-Time Systems
- Vol. 51 (4) , 440-483
Abstract
No abstract availableKeywords
This publication has 36 references indexed in Scilit:
- A survey of hard real-time scheduling for multiprocessor systemsACM Computing Surveys, 2011
- Bridging functional heterogeneity in multicore architecturesACM SIGOPS Operating Systems Review, 2011
- Scheduling with processing set restrictions: A surveyInternational Journal of Production Economics, 2008
- Schedulability Analysis of Multiprocessor Sporadic Task Systems2007
- Proportionate progress: A notion of fairness in resource allocationAlgorithmica, 1996
- Applying new scheduling theory to static priority pre-emptive schedulingSoftware Engineering Journal, 1993
- Multiprocessor online scheduling of hard-real-time tasksIEEE Transactions on Software Engineering, 1989
- Finding Response Times in a Real-Time SystemThe Computer Journal, 1986
- On the complexity of fixed-priority scheduling of periodic, real-time tasksPerformance Evaluation, 1982
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973