• Corpus ID: 17816203

Task Priority Optimization in Real-Time Multi-Core Embedded Systems

@inproceedings{Lalo2014TaskPO,
  title={Task Priority Optimization in Real-Time Multi-Core Embedded Systems},
  author={Erjola Lalo and Michael Deubzer and Stefan Schmidhuber and Erna Oklapi and J{\"u}rgen Mottok},
  year={2014}
}
The shift from single-core to multi-core processors in real-time embedded systems leads to communication based effects on timing such as inter-core communication delays and blocking times. Moreover, the complexity of the scheduling problem increases when multi-core processors are used. In priority-based-scheduling, a fixed priority assignment is used in order to enable predictable behavior of the system. Predictability means that the system has to be analyzable which allows the detection of… 

Figures and Tables from this paper

References

SHOWING 1-10 OF 20 REFERENCES
Robust scheduling of real-time applications on efficient embedded multicore systems
TLDR
A task set extension is proposed, which defines complex task activation patterns and the variation of non-preemptive parts of the task execution time in multicore real-time scheduling algorithms Partly-Pfair-PD² and P-ERfair- PD².
Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
TLDR
It is proved that Audsley’s Optimal Priority Assignment (OPA) algorithm is applicable to the multiprocessor case, provided that three conditions hold with respect to the schedulability tests used.
Priority Assignment for Global Fixed Priority Pre-Emptive Scheduling in Multiprocessor Real-Time Systems
TLDR
This paper proves that Audsley's Optimal Priority Assignment (OPA) algorithm is applicable to the multiprocessor case, provided that three conditions hold with respect to the schedulability tests used.
Permutational Genetic Algorithm for the Optimized Assignment of Priorities to Tasks and Messages in Distributed Real-Time Systems
TLDR
This paper shows that the genetic algorithm can find more and better schedulable priority assignments than HOPA, which is, as far as the authors know, one of the best methods for the fixed priority assignment in distributed real-time systems.
OPTIMAL PRIORITY ASSIGNMENT AND FEASIBILITY OF STATIC PRIORITY TASKS WITH ARBITRARY START TIMES
TLDR
This paper presents an method of determining if the tasks with arbitrary release times will ever share a common release time, and an optimal priority assignment method is given, of complexity O(n 2 + n) in the number of tasks.
Robust Priority Assignment for Fixed Priority Real-Time Systems
TLDR
The paper shows that "deadline minus jitter" monotonic priority ordering is the robust priority ordering for a specific class of system, and that this property holds essentially independent of the additional interference function.
Scheduling algorithms for multiprogramming in a hard-real-time environment
The problem of multiprogram scheduling on a single processor is studied from the viewpoint of the characteristics peculiar to the program functions that need guaranteed service. It is shown that an
A survey of hard real-time scheduling for multiprocessor systems
TLDR
The survey outlines fundamental results about multiprocessor real-time 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.
Immune Genetic Algorithms for Optimization of Task Priorities and FlexRay Frame Identifiers
TLDR
The optimization approach is based on immune genetic algorithms, where in addition to the crossover and mutation operators, this work uses a vaccination operator that results in considerable improvements in optimization time and quality.
...
...