Partitioned EDF scheduling on a few types of unrelated multiprocessors
- 18 October 2012
- journal article
- Published by Springer Nature in Real-Time Systems
- Vol. 49 (2) , 219-238
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The Design of Approximation Algorithms2011
- On the Configuration-LP for Scheduling on Unrelated MachinesLecture Notes in Computer Science, 2011
- Utilization Bounds for EDF Scheduling on Real-Time Multiprocessor SystemsReal-Time Systems, 2004
- Improved approximation schemes for scheduling unrelated parallel machines1999
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation ApproachSIAM Journal on Computing, 1988
- Using dual approximation algorithms for scheduling problems theoretical and practical resultsJournal of the ACM, 1987
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- On the complexity of integer programmingJournal of the ACM, 1981
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973
- Linear Programming and Extensions1963