Discrete Geometry Applied in Hard Real-Time Systems Validation

Largeteau, Gaëlle; Geniet, Dominique; Andrès, Éric

doi:10.1007/978-3-540-31965-8_3

Cited by 9 publications

(3 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, our results encourage us to further the approach we have studied to more general systems: we have extended the scope of this methodology to realtime systems composed of both periodic and sporadic jobs [17]: a sporadic job is associated with an alarm signal, which is obviously not periodic. At another location, observation of the geometric properties of the automata's graphs has prompted us to adopt a new approach toward validating real-time, and it appears to be highly efficient [24]. At some future time, we are planning to apply these results so as to provide assistance for real-time conceivers in the operational specification process.…”

Section: Resultsmentioning

confidence: 99%

WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model

Geniet

Largeteau²

2007

Theoretical Computer Science

Self Cite

View full text Add to dashboard Cite

International audienceThis paper presents the initial step of an aid design method earmarked for operational validation of hard real-time systems. We consider systems that are composed of sequential hard real-time tasks, which are embedded on centralized multiprocessor architectures. We introduce a model based upon untimed finite automata and meant to collect the operational behaviors of the system compatible with its time specifications, and we go on to provide a feasibility decision result for systems composed of tasks presenting CPU loads which are exact values: execution times are not WCET values. This is why we call this approach WCET-free analysis. The results we have achieved likewise involve hardware specifications such as multiprocessors and speeds of processors

show abstract

Section: Resultsmentioning

confidence: 99%

WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model

Geniet

Largeteau²

2007

Theoretical Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…These approaches are generally modeldriven and are based on task system modelling using e.g. Petri nets, automata, geometric models... [6,35,21,23,25,13].…”

Section: Real-time Periodic Schedulingmentioning

confidence: 99%

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

Choquet-Geniet

Malo²

2014

Revue Africaine De Recherche en Informatique Et Mathématiques Appliquées

View full text Add to dashboard Cite

International audience 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. Nous considérons des systèmes temps-réel composés de tâches périodiques et d’un fluxapériodique. Toutes les tâches, périodiques comme apériodiques, sont soumises à des échéancesstrictes. Une tâche apériodique n’est acceptée que si elle ne remet pas en cause le respect deséchéances par les tâches périodiques et par les tâches apériodiques déjà acceptées. Nous proposonsun protocole d’acceptation des tâches apériodiques de complexité linéaire en le nombre de tâchesapériodiques acceptées présentes dans le système. Ce protocle est utilisable dès lors que les tempscreux sont répartis de manière équitable. Nous proposons donc une approche modèle, à base deréseaux de Petri, pour produire des séquences où les temps creux sont équitablement répartis, pourdes systèmes de tâches interdépendantes.

show abstract

“…Such an approach has a lower complexity than the former approaches, as well for the model generation as for the model analysis. In (15), we have defined a discrete geometrical model equivalent to the automata based model presented in (11). In this model, each task is associated with a 2D-discrete object that collects all the valid states of the task, i.e.…”

Section: Introductionmentioning

confidence: 99%

Integrating PFairness within a model based scheduling tool

Choquet-Geniet

Skapin-Largeteau

Ouattara

2010

Electronic Workshops in Computing

View full text Add to dashboard Cite

In this paper, we focus on the use of discrete geometry for the sake of real-time modeling and analysis. We consider multiprocessor context and task sets with offsets, constrained deadlines and critical resources. We want to take regularity criteria into account during the scheduling process. We thus determine the geometrical characterisation of PFair schedules and present the construction steps of a geometric Pfair model. Several uses of this model are then presented: we can select (partially) PFair schedules. We have also defined a PFairness comparison criterion and we use it to choose among a set of feasible schedules the most PFair ones.

show abstract

Discrete Geometry Applied in Hard Real-Time Systems Validation

Cited by 9 publications

References 6 publications

WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model

WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model

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

Integrating PFairness within a model based scheduling tool

Contact Info

Product

Resources

About