Stack-based scheduling for realtime processes
Real-Time Systems
Stochastic dominance and expected utility: survey and analysis
Management Science
An extendible approach for analyzing fixed priority hard real-time tasks
Real-Time Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
IEEE Transactions on Computers
Stochastic Analysis of a Reseveration Based System
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Probabilistic performance guarantee for real-time tasks with varying computation times
RTAS '95 Proceedings of the Real-Time Technology and Applications Symposium
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Real-time queueing network theory
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Statistical Rate Monotonic Scheduling
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
WCET Analysis of Probabilistic Hard Real-Time Systems
RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
Stochastic Analysis of Periodic Real-Time Systems
RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
Probabilistic analysis and scheduling of critical soft real-time systems
Probabilistic analysis and scheduling of critical soft real-time systems
Pessimism in the Stochastic Analysis of Real-Time Systems: Concept and Applications
RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
An Exact Stochastic Analysis of Priority-Driven Periodic Real-Time Systems and Its Approximations
IEEE Transactions on Computers
Real-Time Applications with Stochastic Task Execution Times: Analysis and Optimisation
Real-Time Applications with Stochastic Task Execution Times: Analysis and Optimisation
Re-sampling for statistical timing analysis of real-time systems
Proceedings of the 20th International Conference on Real-Time and Network Systems
Generalized weakly-hard constraints
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: applications and case studies - Volume Part II
PROARTIS: Probabilistically Analyzable Real-Time Systems
ACM Transactions on Embedded Computing Systems (TECS) - Special Section on Probabilistic Embedded Computing
Formal analysis of sporadic bursts in real-time systems
Proceedings of the Conference on Design, Automation and Test in Europe
Formal analysis of sporadic overload in real-time systems
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
Challenges and new trends in probabilistic timing analysis
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
A review of fixed priority and EDF scheduling for hard real-time uniprocessor systems
ACM SIGBED Review - Special Issue on the 3rd Embedded Operating System Workshop (EWiLi 2013)
| Hi-index | 0.00 |
Exact stochastic analysis of most real-time systems under preemptive priority-driven scheduling is unaffordable in current practice. Even assuming a periodic and independent task model, the exact calculation of the response time distribution of tasks is not possible except for simple task sets. Furthermore, in practice, tasks introduce complexities such as release jitter, blocking in shared resources, etc., which cannot be handled by the periodic independent task set model.In order to solve these problems, exact analysis must be abandoned for an approximated analysis. However, in the real-time field, approximations must not be optimistic, i.e. the deadline miss ratios predicted by the approximated analysis must be greater than or equal to the exact ones. In order to achieve this goal, the concept of pessimism needs to be mathematically defined in the stochastic context, and the pessimistic properties of the analysis carefully derived.This paper provides a mathematical framework for reasoning about stochastic pessimism, and obtaining mathematical properties of the analysis and its approximations. This framework allows us to prove the safety of several proposed approximations and extensions. We analyze and solve some practical problems in the implementation of the stochastic analysis, such as the problem of the finite precision arithmetic or the truncation of the probability functions. In addition, we extend the basic model in several ways, such as the inclusion of shared resources, release jitter or non-preemptive sections.