Hard and Soft Real-Time Systems
A scheduling analysis framework for predicting the weakly hard real-time systems
... A hard real-time system is very restrictive because all the tasks must meet the deadlines or, in other words, no deadlines are allowed to be ...a soft real-time system is too ...
40
Soft real-time scheduling on multiprocessors
... on real-time scheduling on multiprocessors has focused only on hard real-time ...a hard real-time system, no deadline may ever be ...for soft ...
393
Analysis and implementation of consistency and fault tolerance mechanisms in soft real-time systems
... The impairments to dependability are faults, errors and failures. They are not desired and appear unexpectedly, causing and resulting in undependable states [34]. In particular, the complete elimination of software ...
109
REAL-TIME SCHEDULING OF SOFT PERIODIC TASKS ON MULTIPROCESSOR SYSTEMS: A FUZZY MODEL
... 349 real-time systems because in these systems having the right answer too late is as bad as not having it at all ...of time which is called deadline. In general, ...
8
Dynamic Integrated Scheduling of Hard Real-Time, Soft Real-Time and Non-Real-Time Processes
... ple, that there are always some resources available to the best-effort processes. RBED assigns periods in cases where application do not already have them. Hard and soft real-time tasks have ...
12
A New Quality of Service Metric for Hard/Soft Real-Time Applications
... Abstract Real-time applications often have mixed hard and soft deadlines, can be preempted subject to the cost of context switching or the restart of computation, and have various data ...
5
On the effectiveness of cache partitioning in hard real-time systems
... In hard real-time systems, cache partitioning is often suggested as a means of increasing the predictability of caches in pre-emptively scheduled systems: when a task is assigned its ...
47
Energy efficient scheduling for hard real-time systems
... Only recently, more and more attention has been put on cluster-based multi- core processor platforms. [KZS11] has focused on the problem of clustering processor cores into DVS domains. The authors proposed to group simi- ...
200
Multi-Mode Virtualization for Soft Real-Time Systems
... dynamic real-time systems. In contrast to existing real-time virtualization platforms supporting static resource allocations, M2-Xen can adapt resource allocations among ...
14
Data-Mining Synthesised Schedulers for Hard Real-Time Systems
... embedded systems, where we have strin- gent memory ...ecution time, which we would like to render as small as possible; indeed, in our models we make the assumption that the scheduler executes “instantly”, ...
11
CiteSeerX — Integrating Multimedia Applications in Hard Real-Time Systems
... replenishing time, causes a big differ- ence in the performance offered by the two servers to soft real-time ...idle time coming from early completions, a re- claiming mechanism has ...
10
Scheduling algorithms and timing analysis for hard real-time systems
... • Non-preemptive: with non-preemptive scheduling, once a job/task has started to execute, it cannot be preempted until it finishes the execution. The scheduler is only invoked at the end of a job (assuming the interrupts ...
171
Towards Model-Driven Development of Hard Real-Time Systems
... Figure 5. Basic block graph in a loop, with timing information This tool serves as a one-stop information center that can be used to quickly review the effects of changes made to the project. The ASCET software ...
17
Efficient Adaptive Hard Real-time Multi-processor Systems
... Les systèmes informatiques modernes sont basés sur des systèmes multiprocesseurs, c’est-à-dire avec plusieurs cœurs sur la même puce. Des systèmes temps-réel durs sont nécessaires pour effectuer des tâches particulières ...
123
Timing-predictable memory allocation in hard real-time systems
... execution time of the ...However, hard real-time applications do currently not—or better very rarely—make use of dynamically allocated ...
183
WCET Optimizations and Architectural Support for Hard Real-Time Systems
... not time predictable, so why do we need to use ATF? This is equivalent to say since caches are faster than main memory, a processor with a cache will definitely have better performance than a processor without a ...
166
A Survey and Comparative Study of Hard and Soft Real-Time Dynamic Resource Allocation Strategies for Multi-/Many-Core Systems
... Multi/Many-core Systems Resource allocation (mapping) process defines assignment and ordering of the tasks and their communications onto resources of multi/many-core system 1 in view of some optimization criteria ...
38
Hard Real-Time Linux
... as Real-Time Operating System Affinity and Cpuset Still unanswered questions Up to this point we have seen how to: Obtain RT scheduling policies through Linux Scheduler Use IRQ affinity and Cpusets to get ...
41
Soft Real-Time Task Response Time Prediction in Dynamic Embedded Systems
... embedded systems in a huge diversity of products, towards the implementation of ubiquitous systems in different envi- ronments, creates the demand for an always larger diversity of ...embedded ...
10
Energy-aware Fault-tolerant Scheduling for Hard Real-time Systems
... compatibility index is an accurate metric to quantify how “compatible” a task set is and can guide task partitioning correctly. 6.8 Summary and future directions As the computing paradigm shifts toward multi-core ...
176