Theory of linear and integer programming
Theory of linear and integer programming
The MARUTI hard real-time operating system
ACM SIGOPS Operating Systems Review
Introduction to algorithms
Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
SIAM Journal on Computing
Parametric scheduling for hard real-time systems
Parametric scheduling for hard real-time systems
Deciding Linear Inequalities by Computing Loop Residues
Journal of the ACM (JACM)
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
An Introduction to Discrete Mathematics and Its Applications
An Introduction to Discrete Mathematics and Its Applications
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
Totally clairvoyant scheduling with relative timing constraints
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
| Hi-index | 0.00 |
The problem of parametric scheduling is concerned with checking whether a job-set is parametrically schedulable, subject to a set of imposed constraints. In real-time scheduling, parameterization of the schedule plays an important role in extending the flexibility of the scheduler, particularly in the presence of variable execution times. It has been shown that the existence of parametric schedules can be determined in polynomial time when the constraints are restricted to those that can be represented by a network, unimodular matrix. In this paper, we extend the class of constraints for which parametric schedules can be determined efficiently to include network constraints, such as weighted sum of completion times.