Theory of linear and integer programming
Theory of linear and integer programming
The MARUTI hard real-time operating system
ACM SIGOPS Operating Systems Review
The real-time operating system of MARS
ACM SIGOPS Operating Systems Review
Parametric scheduling for hard real-time systems
Parametric scheduling for hard real-time systems
Parametric Dispatching of Hard Real-Time Tasks
IEEE Transactions on Computers
Duality in the parametric polytope and its applications to a scheduling problem
Duality in the parametric polytope and its applications to a scheduling problem
A Specification Framework for Real-Time Scheduling
SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
| Hi-index | 0.00 |
Parametric Scheduling is a scheduling technique used to partially address the inflexibility of static scheduling in real-time systems. Real-Time scheduling confronts two issues not addressed by traditional scheduling models viz. parameter variability and the existence of complex relationships constraining the execution of tasks. Accordingly, modeling becomes crucial in the specification of scheduling problems. In this paper, we study the complexity of parametric scheduling as modeled within the E-T-C scheduling framework [Sub00]. We establish that (a) The parametric schedulability query is in PSPACE for generalized constraints, and (b) Parametric dispatching is not harder than deciding the schedulability query. To the best of our knowledge, our results are the first of their kind for this problem.