Scheduling Hard Sporadic Tasks by Means of Finite Automata and Generating Functions

Authors:
Jean-Philippe Dubernard;Dominique Geniet
Affiliations:
-;-
Venue:
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Year:
2001

Citing 9
Cited 0

Stack-based scheduling for realtime processes

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

Finite transition systems: semantics of communicating systems
Fixed priority pre-emptive scheduling: an historical perspective

Real-Time Systems - Special issue: history of real-time systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Automata, Languages, and Machines

Automata, Languages, and Machines
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications

Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms

Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
The Power of Reachability Testing for Timed Automata

Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Cooperating Sequential Processes, Technical Report EWD-123

Cooperating Sequential Processes, Technical Report EWD-123

Quantified Score

Hi-index	0.01

Visualization

Abstract

In a previous work, we propose a technique to decide feasability of periodic hard real-time systems based on finite automata. Here, associating generating functions (whose role is "to predict the future") to a finite automaton, we extend this technique to hard sporadic tasks, independent or interdependent with the periodic tasks.