Integer and combinatorial optimization
Integer and combinatorial optimization
The MARUTI hard real-time operating system
ACM SIGOPS Operating Systems Review
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
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
Issues in temporal reasoning for autonomous control systems
AGENTS '98 Proceedings of the second international conference on Autonomous agents
Fast transformation of temporal plans for efficient execution
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Computer Control of Manufacturing Systems
Computer Control of Manufacturing Systems
Real-Time Systems
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Parametric Dispatching of Hard Real-Time Tasks
IEEE Transactions on Computers
Parametric Scheduling - Algorithms and Complexity
HiPC '01 Proceedings of the 8th International Conference on High Performance Computing
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
Parametric Scheduling for Network Constraints
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
A Dual Interpretation of "Standard Constraints" in Parametric Scheduling
FTRTFT '00 Proceedings of the 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
Periodic Linear Programming with applications to real-time scheduling
Mathematical Structures in Computer Science
An Analysis of Totally Clairvoyant Scheduling
Journal of Scheduling
Distributed algorithms for partially clairvoyant dispatchers
Cluster Computing
An empirical analysis of algorithms for partially Clairvoyant scheduling
International Journal of Parallel, Emergent and Distributed Systems
On the design and implementation of a shared memory dispatcher for partially clairvoyant schedulers
International Journal of Parallel Programming
An analysis of quantified linear programs
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Zero-Clairvoyant scheduling with inter-period constraints
ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday
A shared memory dispatching approach for partially clairvoyant schedulers
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
Hi-index | 0.00 |
Scheduling in Real-time systems differs from scheduling in conventional models in two principal ways: (a) Execution time variability, and (b) Existence of complex constraints between jobs. There is a third issue that indirectly depends upon the non-constant nature of execution times, viz. the degree of clairvoyance permitted by the application. Whereas traditional scheduling models assume fixed values for job execution time, we model execution times of jobs through convex sets; doing so permits the capturing of situations that could not be modeled otherwise. A feature that is unique to real-time systems is the presence of temporal relationships that constrain job execution. Consider for instance the requirement that job J1 should conclude 10 units before job J2. This can be modeled through a simple, linear relationship, between the start and execution times of jobs J1 and J2, however precedence graphs are inadequate for this purpose. In hard, real-time scheduling, it is important to guarantee a priori, the schedulability of the system, since the violation of a constraint leads to catastrophic consequences. Depending upon the nature of the application involved, there are 3 different schedulability specifications viz. Static (Zero-Clairvoyant), Parametric (Partially Clairvoyant) and Co-Static (Totally Clairvoyant). Each specification affords a different level of flexibility and has different dispatching concerns. In this paper, we present a framework that enables the specification of real-time scheduling problems and discuss the relationship between flexibility and complexity in the proposed model. We motivate each aspect of our model through examples from real-world design.