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
Scheduling Periodic Jobs that Allow Imprecise Results
IEEE Transactions on Computers
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Algorithms for Scheduling Real-Time Tasks with Input Error and End-to-End Deadlines
IEEE Transactions on Software Engineering
An Optimal Algorithm for Scheduling Soft Aperiodic Tasks in Dynamic-Priority Preemptive Systems
IEEE Transactions on Software Engineering
Scheduling Algorithms
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Foundations of Real-Time Computing: Scheduling and Resource Management
Foundations of Real-Time Computing: Scheduling and Resource Management
Hard Real-Time Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Parametric Dispatching of Hard Real-Time Tasks
IEEE Transactions on Computers
Developments from a June 1996 seminar on Online algorithms: the state of the art
Developments from a June 1996 seminar on Online algorithms: the state of the art
An Analysis of Zero-Clairvoyant Scheduling
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
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
Developments from a June 1996 seminar on Online algorithms: the state of the art
Speed is as powerful as clairvoyance [scheduling problems]
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Statistical Rate Monotonic Scheduling
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Duality in the parametric polytope and its applications to a scheduling problem
Duality in the parametric polytope and its applications to a scheduling problem
Chain programming over difference constraints
Nordic Journal of Computing
Optimal Length Resolution Refutations of Difference Constraint Systems
Journal of Automated Reasoning
A randomized algorithm for BBCSPs in the prover-verifier model
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Analyzing chain programs over difference constraints
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
| Hi-index | 0.00 |
Traditional scheduling models assume that the execution time of a job in a periodic job-set is constant in every instance of its execution. This assumption does not hold in real-time systems wherein job execution time is known to vary. A second feature of traditional models is their lack of expressiveness, in that constraints more complex than precedence constraints (for instance, relative timing constraints) cannot be modeled. Thirdly, the schedulability of a real-time system depends upon the degree of clairvoyance afforded to the dispatcher. In this paper, we shall discuss Totally Clairvoyant Scheduling, as modeled within the E-T-C scheduling framework (Subramani, 2002). We show that this instantiation of the scheduling framework captures the central issues in a real-time flow-shop scheduling problem and devise a polynomial time sequential algorithm for the same. The design of the polynomial time algorithm involves the development of a new technique, which we term Mutable Dynamic Programming. We expect that this technique will find applications in other areas of system design, such as Validation and Software Verification. We also introduce an error-minimizing performance metric called Violation Degree and establish that optimizing this metric in a Totally Clairvoyant Scheduling System is NP-Hard.