Estimating probabilistic timing performance for real-time embedded systems
- 1 December 2001
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 9 (6), 833-844
- https://doi.org/10.1109/92.974897
Abstract
In system-level design of real-time embedded systems, being able to capture the interactions among the tasks with respect to timing constraints and determine the overall system timing performance is a major challenge. Most previous works in the area are either based on a fixed execution time model or are only concerned with the probabilistic timing behavior of each individual task. The few papers that deal with overall system probabilistic behavior have used improper assumptions. In this paper, given that the execution time of each task is a discrete random variable, a novel concept of state is introduced based on a new metric that is derived that measures the probability of a task set being able to be scheduled. Several approaches to evaluating the metric are also presented. Applying this metric in the system-level design exploration process, one can readily compare the probabilistic timing performance of alternative designs.Keywords
This publication has 15 references indexed in Scilit:
- Allocation of periodic task modules with precedence and deadline constraints in distributed real-time systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A multiframe model for real-time tasksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A tool for performance estimation of networked embedded end-systemsPublished by Association for Computing Machinery (ACM) ,1998
- Scheduling algorithms and operating systems support for real-time systemsProceedings of the IEEE, 1994
- A new algorithm for scheduling periodic, real-time tasksAlgorithmica, 1989
- On the complexity of fixed-priority scheduling of periodic, real-time tasksPerformance Evaluation, 1982
- A note on preemptive scheduling of periodic, real-time tasksInformation Processing Letters, 1980
- Guaranteed Response Times in a Hard-Real-Time EnvironmentIEEE Transactions on Software Engineering, 1980
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973
- Production and Stabilization of Real-Time Task SchedulesJournal of the ACM, 1967