Toward real-time performance benchmarks for Ada
Communications of the ACM
Real-Time Scheduling Theory and Ada
Computer
A practitioner's handbook for real-time analysis
A practitioner's handbook for real-time analysis
On the accuracy of predicting rate monotonic scheduling performance
TRI-Ada '90 Proceedings of the conference on TRI-ADA '90
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Social processes and proofs of theorems and programs
Communications of the ACM
ACM SIGAda Ada Letters
The Science of Programming
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Reimplementing a multiprocess distributed paradigm for real-time systems in Ada 95
IRTAW '97 Proceedings of the eighth international workshop on Real-Time Ada
Using an architecture description language for quantitative analysis of real-time systems
WOSP '02 Proceedings of the 3rd international workshop on Software and performance
Software portability gains realized with METAH and Ada95
IRTAW '02 Proceedings of the 11th international workshop on Real-time Ada workshop
Scheduler Modeling Based on the Controller Synthesis Paradigm
Real-Time Systems
Formalizing Software Architectures for Embedded Systems
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
Response Time Analysis of Asynchronous Real-Time Systems
Real-Time Systems
A formal approach to robustness maximization of complex heterogeneous embedded systems
CODES+ISSS '06 Proceedings of the 4th international conference on Hardware/software codesign and system synthesis
Analysis of window-constrained execution time systems
Real-Time Systems
Methods for multi-dimensional robustness optimization in complex embedded systems
EMSOFT '07 Proceedings of the 7th ACM & IEEE international conference on Embedded software
Minimum Deadline Calculation for Periodic Real-Time Tasks in Dynamic Priority Systems
IEEE Transactions on Computers
Sensitivity analysis of complex embedded real-time systems
Real-Time Systems
Sensitivity analysis for fixed-priority real-time systems
Real-Time Systems
Period sensitivity analysis and D-P domain feasibility region in dynamic priority systems
Journal of Systems and Software
Integration of time issues into component-based applications
CBSE'07 Proceedings of the 10th international conference on Component-based software engineering
Robust design of embedded systems
Proceedings of the Conference on Design, Automation and Test in Europe
Towards a simple meta-model for complex real-time and embedded systems
MEDI'11 Proceedings of the First international conference on Model and data engineering
EUC'06 Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing
A task generation method for the development of embedded software
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part IV
Embedded Systems Design
Reducing the gap between design and scheduling
Proceedings of the 20th International Conference on Real-Time and Network Systems
| Hi-index | 0.01 |
Several formal results exist that allow an analytic determination of whether a particular scheduling discipline can feasibly schedule a given set of hard real-time periodic tasks. In most cases, these results provide little more than a 'yes' or 'no' answer. In practice, it is also useful to know how sensitive scheduling feasibility is to changes in the characteristics of the task set. This paper presents algorithms that allow a system developer to determine, for fixed-priority preemptive scheduling of hard real-time periodic tasks on a uniprocessor, how sensitive schedule feasibility is to changes in the computation times of various software components. The algorithms allow a system developer to determine what changes in task computation times can be made while preserving schedule feasibility (or what changes are needed to achieve feasibility). Both changes to the computation time of a single task and changes to the computation times of a specified subset of the tasks are analyzable. The algorithms also allow a decomposition of tasks into modules, where a module may be a component of multiple tasks.