The Knapsack-Lightening problem and its application to scheduling HRT tasks
[ 1 ] Instytut Informatyki (II), Wydział Informatyki i Zarządzania, Politechnika Poznańska | [ P ] pracownik
2009
artykuł naukowy
angielski
- algorithms
- computational complexity
- knapsack problem
- greedy algorithms
- branch and bound scheduling
- real-time systems
- cache memory
- periodic loading
EN In hard real-time systems timeliness is as important as functional correctness. Such systems contain so called hard real-time tasks (HRT tasks) which must be finished by a given deadline. One of the methods of scheduling of HRT tasks is periodic loading introduced by Schweitzer, Dror, and Trudeau. The paper presents an extension to that method which allows for deterministic utilization of cache memory in hard real-time systems. It is based on a new version of the Knapsack problem named Knapsack-Lightening. In the paper the Knapsack-Lightening problem is defined, its complexity is analyzed, and an exact algorithm along with two heuristics are presented. Moreover the application of the Knapsack-Lightening problem to scheduling HRT tasks is described.
71 - 77
CC BY-NC-ND (uznanie autorstwa - użycie niekomercyjne - bez utworów zależnych)
otwarte czasopismo
ostateczna wersja opublikowana
publiczny
0,626