Skip to Main content Skip to Navigation
Journal articles

Scheduling an aperiodic flow within a real-time system using Fairness properties

Abstract : We consider hard real-time systems composed of periodic tasks and of an aperiodic flow. Each task, either periodic or aperiodic, has a firm deadline. An aperiodic task is accepted within the system only if it can be completed before its deadline, without causing temporal failures for the periodic tasks or for the previously accepted aperiodic tasks. We propose an acceptance test, linear in the number of pending accepted aperiodic tasks. This protocol can be used provided the idle slots left by the periodic tasks are fairly distributed. We then propose a model-driven approach, based on Petri nets, to produce schedules with a fair distribution of the idle slots for systems of non independent periodic tasks.
Document type :
Journal articles
Complete list of metadata

https://hal.inria.fr/hal-01300085
Contributor : Coordination Episciences Iam <>
Submitted on : Friday, April 8, 2016 - 4:37:52 PM
Last modification on : Wednesday, October 30, 2019 - 4:34:07 PM
Long-term archiving on: : Tuesday, November 15, 2016 - 12:10:53 AM

File

Vol.18.pp.93-116.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01300085, version 1

Collections

Citation

Annie Choquet-Geniet, Sadouanouan Malo. Scheduling an aperiodic flow within a real-time system using Fairness properties. Revue Africaine de la Recherche en Informatique et Mathématiques Appliquées, INRIA, 2014, 18, pp.93-116. ⟨hal-01300085⟩

Share

Metrics

Record views

172

Files downloads

1000