A Multiframe Model for Real-Time Tasks
IEEE Transactions on Software Engineering
Real-Time Systems
Schedulability of event-driven code blocks in real-time embedded systems
Proceedings of the 39th annual Design Automation Conference
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Dynamic- and Static-priority Scheduling of Recurring Real-time Tasks
Real-Time Systems
Moses - a tool suite for visual modeling of discrete-event systems
HCC '01 Proceedings of the IEEE 2001 Symposia on Human Centric Computing Languages and Environments (HCC'01)
Schedulability of generalized multiframe task sets under static priority assignment
RTCSA '97 Proceedings of the 4th International Workshop on Real-Time Computing Systems and Applications
A General Model for Recurring Real-Time Tasks
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Approximate Schedulability Analysis
RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
An Event Stream Driven Approximation for the Analysis of Real-Time Systems
ECRTS '04 Proceedings of the 16th Euromicro Conference on Real-Time Systems
Design Space Exploration and System Optimization with SymTA/S " Symbolic Timing Analysis for Systems
RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems
Optimal Task Rate Selection in Fixed Priority Systems
RTSS '05 Proceedings of the 26th IEEE International Real-Time Systems Symposium
| Hi-index | 0.00 |
A typical design process for real-time embedded systems involves choosing the values of certain system parameters and performing a schedulability analysis to determine whether all deadline constraints can be satisfied. If such an analysis returns a negative answer, then some of the parameters are modified and the analysis is invoked once again. This iteration is repeated until a schedulable design is obtained. However, the schedulability analysis problem for most task models is intractable (usually co-NP hard) and, hence, such an iterative design process is often very expensive. To get around this problem, we introduce the concept of “interactive” schedulability analysis. It is based on the observation that if only a small number of system parameters are changed, then it is not necessary to rerun the full schedulability analysis algorithm, thereby making the iterative design process considerably faster. We refer to this analysis as being “interactive” because it is supposed to be run in an interactive mode. This concept is fairly general and can be applied to a wide variety of task models. In this paper, we have chosen the recurring real-time task model, because it can be used to represent realistic applications from the embedded systems domain (containing conditional branches and fine-grained deadline constraints). Our experimental results show that using our scheme can lead to more than 20× speedup for each invocation of the schedulability analysis algorithm, compared to the case where the full algorithm is run.