The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
A federated approach to the multiprocessor scheduling of systems of independent recurrent tasks is considered, in which each task is either restricted to execute preemptively upon a single processor, or may execute upon multiple processors but gets exclusive access to all these processors. Efficient polynomial-time algorithms are derived here for the federated schedulability analysis and run-time...
In model based approaches for real-time systems (RTS) development, an iterative process that consists in the early stage verification of real-time constraints fulfillment according to a given design is usually performed in order to detect as early as possible unfeasible designs. Schedulability analysis allows this early verification of timing constraints according to so called Schedulability Analysis...
Limited preemption models have been proposed as a viable alternative between the two extreme cases of fully preemptive and non-preemptive scheduling. In particular, allowing preemption to occur only at predefined preemption points reduces context switch costs, simplifies the access to shared resources, and allows more predictable estimations of worst-case execution times. Current results related to...
The generalized multi frame (GMF) task has been proposed to model a task whose execution times, deadlines and minimum separation times are changed according to a specified pattern. In this paper we relax the assumption of having a specified activation pattern, this yields to non-cyclic GMF task. In this context, current schedulability analysis techniques for GMF task sets under dynamic priority assignment...
Real-time systems used in media processing and transmission produce bursty workloads with highly variable execution and transmission times. To avoid the drawbacks of using the worst-case approach with these workloads, this paper uses a variation of the usual real-time task model where the WCET is replaced by a discrete statistical distribution. Using this approach, tasks are characterized by their...
Analysis and verification of safety critical systems is inevitable to assure functional and temporal correctness. For checking temporal system behaviour, real-time scheduling analysis has been proved to be an efficient method. As an analytical method, real-time scheduling relies on rather simple task network models mostly ignoring functional behaviour in order to remain computable and efficient. Functional...
Schedulability analysis based the worst-case response time is an important research issue in real-time systems. Due to the restriction that the traditional schedulability analysis for fault-tolerant real-time systems only considered that the deadline of each task must be no larger than its period, this paper extends the computation model that the deadline of each task can be longer than its period...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.