Scheduling hard sporadic tasks with regular languages and generating functions

Authors:
Dominique Geniet;Jean-Philippe Dubernard
Affiliations:
Laboratoire d'Informatique Scientifique et Industrielle, Téléport 2, Site du Futuroscope, Futuroscope Chasseneuil Cédex F-86961, France;Laboratoire d'Informatique Fondamentale et Appliquée de Rouen, Place Émile Blondel, Mont-Saint-Aignan Cédex F-76821, France
Venue:
Theoretical Computer Science - Implementation and application automata
Year:
2004

Citing 7
Cited 1

Rational series and their languages

Rational series and their languages
Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor

Real-Time Systems
Finite transition systems: semantics of communicating systems

Finite transition systems: semantics of communicating systems
A theory of timed automata

Theoretical Computer Science
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Direct and dual laws for automata with multiplicities

Theoretical Computer Science
Semirings, Automata and Languages

Semirings, Automata and Languages

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

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider offline validation of hard real-time systems composed of both periodic and sporadic tasks, embedded on centralized multi-processor architectures. To model hard real-time systems, we use untimed finite automata: each accepted word is a valid operational behavior of the periodic component of the system. Then, by associating generating functions with edges of the automaton, we give a modular decisional technique to decide the feasibility of sporadic tasks.