• Corpus ID: 29861929

Robust scheduling of real-time applications on efficient embedded multicore systems

@inproceedings{Deubzer2011RobustSO,
  title={Robust scheduling of real-time applications on efficient embedded multicore systems},
  author={Michael Deubzer},
  year={2011}
}
Multicore processors are the next technological step in order to increase the processing power in embedded real-time systems. This work focuses on scheduling algorithms as well as examination approaches of real-time, efficiency, and robustness properties for complex task sets in these systems. For this purpose, a task set extension is proposed, which defines complex task activation patterns and the variation of non-preemptive parts of the task execution time. Furthermore, the multicore real… 
Optimizing the task allocation step for multi-core processors within AUTOSAR
TLDR
A model-based optimization approach to optimize the task allocation of an embedded system, whose complexity is comparable to that of an actual system, on a multi-core processor.
A modified synchronization model for dead-lock free concurrent execution of strongly interacting task sets in embedded systems
TLDR
The new metric mean Normalized Blocking Time is introduced in order to be able to compare locking mechanisms according to the timing effects of their blocking behavior and to avoid deadlocks.
Probabilistic worst case response time estimation for multi-core real-time systems
TLDR
A new three staged probabilistic estimation concept is presented which allows to estimate Worst Case Response Times with low pessimism ranges compared to estimation methods that uses the Generalized Pareto or the Gumbel max distribution without sample classification.
Reverse engineering of real-time system models from event trace recordings
TLDR
CoreTAna is presented, a prototypical tool that derives an AUTOSAR compliant model of a real-time system by conducting dynamic analysis using trace recordings, and its reverse engineering approach is designed in such a way that it fits seamlessly into the methodology specified by AUTosAR.
Temporal properties in automotive control software
TLDR
This paper provides a framework in which requirements for these abstract properties are documented as part of the interface specifications based on a lightweight extension of event models that also includes abstract properties used in control engineering such as aliasing.
Contract-based integration of automotive control software
TLDR
A novel methodology for an automated identification of integration errors in automotive control software using contracts, which are used to disclose domain level requirements and checked during integration supported by existing tools is presented.
How to Improve the Reactiveness and Efficiency of Embedded Multi-core Systems by Use of Probabilistic Simulation and Optimization Techniques
TLDR
This chapter presents a model-based approach to map the tasks of an embedded real-time system to the cores of a multi-core processor, and integrates the probabilistic simulation within an optimization technique to systematically improve the task-to-core mapping.
Task Priority Optimization in Real-Time Multi-Core Embedded Systems
TLDR
This paper presents an approach for finding near-optimal solutions for task priority assignment and the preemption/cooperation problem and demonstrates that the proposed approach performs better than well known and single-core optimal heuristics for relatively complex systems.

References

SHOWING 1-10 OF 121 REFERENCES
Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor Platforms
TLDR
A general method to derive schedulability conditions for multiprocessor real-time systems will be presented and the analysis will be applied to two typical scheduling algorithms: earliest deadline first (EDF) and fixed priority (FP).
Comparative evaluation of limited preemptive methods
TLDR
This paper provides a comprehensive overview of the possible scheduling approaches that can be used to contain preemptions and presents a comparative study aimed at evaluating their impact on task execution times.
Scheduling analysis of real-time systems with precise modeling of cache related preemption delay
TLDR
A conservative polynomial algorithm is presented that extends real-time scheduling analysis to consider cache effects due to the preempted and the preempting task for the preemption delay for each task accurately.
Scheduling aperiodic tasks in dynamic priority systems
TLDR
Five new on-line algorithms for servicing soft aperiodic requests in realtime systems, where a set of hard periodic tasks is scheduled using the Earliest Deadline First (EDF) algorithm, can achieve full processor utilization and enhance a periodic responsiveness.
Notice of RetractionSensitivity analysis of task period for EDF scheduled arbitrary deadline real-time systems
TLDR
It is proved that a minimum task period can be determined by a single pass of the QPA algorithm, which provides exact and efficient sensitivity analysis for arbitrary deadline real-time systems.
Scheduling Suspendable, Pipelined Tasks with Non-Preemptive Sections in Soft Real-Time Multiprocessor Systems
TLDR
It is shown that any periodic task system with such dependencies can be transformed into one with only suspensions in a way that preserves maximum per-task response times.
A Categorization of Real-Time Multiprocessor Scheduling Problems and Algorithms
TLDR
This chapter analyzes the trade-offs involved in scheduling independent, periodic real-time tasks on a multiprocessor.
Limited Preemptible Scheduling to Embrace Cache Memory in Real-Time Systems
TLDR
A novel scheduling scheme, called LPS (Limited Preemptible Scheduling), is proposed that limits preemptions to predetermined points with small cache-related preemption costs and can increase schedulable utilization and save processor time as compared with a traditional fully preemptible scheduling scheme.
Notice of RetractionSensitivity analysis of relative deadline for EDF scheduled real-time systems
TLDR
It is proved that a minimum task relative deadline can be determined by a single pass of the QPA algorithm, which provides exact and efficient sensitivity analysis for arbitrary deadline real-time systems.
A Survey of Hard Real-Time Scheduling Algorithms and Schedulability Analysis Techniques for Multiprocessor Systems
TLDR
The survey outlines fundamental results about multiprocessor realtime scheduling that hold independent of the scheduling algorithms employed and provides a taxonomy of the different scheduling methods, and considers the various performance metrics that can be used for comparison purposes.
...
...