Towards optimal priority assignment for probabilistic CAN-based systems

Dorin Maxim 1 Liliana Cucu-Grosjean 1
1 TRIO - Real time and interoperability
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We deal in this paper with the existence of optimal priority assignment for periodic activities (tasks or messages) with variable execution times. In the case of one processor (and periodic tasks) we provide first results on Audsley's algorithm for the preemptive and nonpreemptive problems. In the case of a CAN bus (and periodic messages) we conjecture that Audsley's algorithm is also optimal.
Type de document :
Communication dans un congrès
WIP session of the 8th IEEE International Workshop on Factory Communication Systems - WFCS 2010, May 2010, Nancy, France. pp.215--218, 2010, 〈10.1109/WFCS.2010.5548602〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00544692
Contributeur : Liliana Cucu-Grosjean <>
Soumis le : mercredi 8 décembre 2010 - 16:40:24
Dernière modification le : jeudi 11 janvier 2018 - 06:20:05

Identifiants

Collections

Citation

Dorin Maxim, Liliana Cucu-Grosjean. Towards optimal priority assignment for probabilistic CAN-based systems. WIP session of the 8th IEEE International Workshop on Factory Communication Systems - WFCS 2010, May 2010, Nancy, France. pp.215--218, 2010, 〈10.1109/WFCS.2010.5548602〉. 〈inria-00544692〉

Partager

Métriques

Consultations de la notice

75