A NOVEL HEURISTIC ALGORITHM FOR MAPPING AUTOSAR RUNNABLES TO TASKS - Archive ouverte HAL
Communication Dans Un Congrès Année : 2015

A NOVEL HEURISTIC ALGORITHM FOR MAPPING AUTOSAR RUNNABLES TO TASKS

Résumé

This paper describes a novel algorithm that permits to automate the process to map runnables to tasks in any AUTOSAR architecture. This enables to boost system performance by reducing the number of tasks to be implemented and while preserving system schedulability. Our algorithm uses some properties related to the activation offset for mapping runnables with distinct periods to the same task. We consider periodic, independent and fixed-priority tasks running on a single processor. The results of an experimental study are reported. First, they show that our algorithm reduces significantly the number of tasks with distinct periods while preserving system schedulability. And second, the system schedulability bound is increased by 34% compared to the typical periodic solution and the average response time of tasks is reduced by 30% related to ohers solutions.
Fichier principal
Vignette du fichier
PECCS15_CameraReady.pdf (192.77 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01341785 , version 1 (04-07-2016)

Identifiants

  • HAL Id : hal-01341785 , version 1

Citer

Fouad Khenfri, Khaled Chaaban, Maryline Chetto. A NOVEL HEURISTIC ALGORITHM FOR MAPPING AUTOSAR RUNNABLES TO TASKS. 5th International Conference on Pervasive and Embedded Computing and Communication Systems, Feb 2015, Angers, France. ⟨hal-01341785⟩
212 Consultations
615 Téléchargements

Partager

More