Real-time Euclid: a language for reliable real-time systems
IEEE Transactions on Software Engineering - Special issue on reliability and safety in real-time process control
A graph-theoretic approach for timing analysis and its implementation
IEEE Transactions on Computers - Special Issue on Real-Time Systems
Distributed Scheduling of Tasks with Deadlines and Resource Requirements
IEEE Transactions on Computers
Scheduling Processes with Release Times, Deadlines, Precedence and Exclusion Relations
IEEE Transactions on Software Engineering
Calculating the maximum, execution time of real-time programs
Real-Time Systems
Object-oriented real-time language design: constructs for timing constraints
OOPSLA/ECOOP '90 Proceedings of the European conference on object-oriented programming on Object-oriented programming systems, languages, and applications
Scheduling real-time computations with separation constraints
Information Processing Letters
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Performance Estimation for Real-Time Distributed Embedded Systems
IEEE Transactions on Parallel and Distributed Systems
Interval-Based Analysis of Software Processes
OM '01 Proceedings of the 2001 ACM SIGPLAN workshop on Optimization of middleware and distributed systems
Performance estimation for real-time distributed embedded systems
Readings in hardware/software co-design
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 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
Scheduling of Real-Time Tasks with Complex Constraints
Performance Evaluation: Origins and Directions
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
Periodic Linear Programming with applications to real-time scheduling
Mathematical Structures in Computer Science
An Analysis of Totally Clairvoyant Scheduling
Journal of Scheduling
Real-Time Systems
Chain programming over difference constraints
Nordic Journal of Computing
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
Out of order quantifier elimination for Standard Quantified Linear Programs
Journal of Symbolic Computation
An analysis of quantified linear programs
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Efficient scheduling of sporadic, aperiodic, and periodic tasks with complex constraints
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
A new verification procedure for partially clairvoyant scheduling
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Analyzing chain programs over difference constraints
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Totally clairvoyant scheduling with relative timing constraints
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
A shared memory dispatching approach for partially clairvoyant schedulers
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
| Hi-index | 14.98 |
In many real-time systems relative timing constraints are imposed on a set of tasks. Generating a correct ordering for the tasks and deriving their proper start-time assignments is an NP-hard problem; it subsumes the Non-preemptive Scheduling Problem. Even when the application imposes a total order on the tasks, generating proper start-times is still nontrivial if execution times may range between upper and lower bounds.We present the technique of parametric dispatching to enforce such timing constraints. During an off-line component, we check if the constraints can be guaranteed. If so, a calendar is produced that allows our on-line algorithm to generate upper and lower bounds on the start time of each task, based on the start times and execution times of previous tasks. A suitable start time for the task may then be selected taking into account the presence of other non-critical tasks in the system.