Minimal schedulability interval for real-time systems of periodic tasks with offsets

Authors:
Annie Choquet-Geniet;Emmanuel Grolleau
Affiliations:
Laboratoire d'Informatique Scientifique et Industrielle (LISI), Université de Poitlers & E.N.S.M.A., BP 40109, Tééléport 2, Site du Futuroscope, F-86961 Futuroscope Chasseneuil ...;Laboratoire d'Informatique Scientifique et Industrielle (LISI), Université de Poitlers & E.N.S.M.A., BP 40109, Tééléport 2, Site du Futuroscope, F-86961 Futuroscope Chasseneuil ...
Venue:
Theoretical Computer Science
Year:
2004

Citing 10
Cited 5

Misconceptions About Real-Time Computing: A Serious Problem for Next-Generation Systems

Computer
Scheduling Processes with Release Times, Deadlines, Precedence and Exclusion Relations

IEEE Transactions on Software Engineering
Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor

Real-Time Systems
The Non-Optimality of the Monotonic Priority Assignmentsfor Hard Real-Time Offset Free Systems

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
Off-Line Computation of Real-Time Schedules Using Petri Nets

Discrete Event Dynamic Systems
Scheduling Dependent Tasks with Different Arrival Times to Meet Deadlines

Proceedings of the International Workshop organized by the Commision of the European Communities on Modelling and Performance Evaluation of Computer Systems

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

Theoretical Computer Science
Observation tools for effective schedules in a RTOS

ACM SIGBED Review - 2nd Workshop on Embed With Linux (EWiLi 2012)
A semi-partitioned approach for parallel real-time scheduling

Proceedings of the 20th International Conference on Real-Time and Network Systems
The scheduling problem of self-suspending periodic real-time tasks

Proceedings of the 20th International Conference on Real-Time and Network Systems
A Novel Formalism for Partially Defined Asynchronous Feedback Digital Circuits

Journal of Electronic Testing: Theory and Applications

Quantified Score

Hi-index	5.23

Visualization

Abstract

We consider real-time systems in highly safety context where tasks have to meet strict deadlines. Tasks are periodic, may have offsets, share critical resources and be precedence constrained. Off-line scheduling should be of great help for such systems, but methods proposed in the literature cannot deal with them. Our aim is to extend and improve the well-known cyclicity result of Leung and Merill to every scheduling algorithm and to systems of interacting tasks with offsets. One of the main benefit of our result is to enable the use of off-line scheduling methods for those real-time critical systems.