Advertisement

Exhaustive computation of the scheduled task execution sequences of a real-time application

  • Annie Choquet-Geniet
  • Dominique Geniet
  • Francis Cottet
Selected Presentations Scheduling
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1135)

Abstract

We present a methodology for the determination of all the acceptable scheduled execution sequences of a real-time application, i.e. of a set of interacting tasks, submitted to strict temporal constraints. This methodology, based on autonomous Petri nets, produced a set of acceptable sequences which is not reduced to only the sequences provided by the classical scheduling algorithms. Moreover, it enables the computation of all the sequences which meet a given criterion.

Key words

Real-time application Periodic task Deadlines Petri net Terminal markings Petri net with successor constraints Marking graph 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. E. Best, C. Fernandez, “Notations and terminology on Petri nest”, Arbeitspapiere der GMD, Sank Augustin, vol. 195, 1986Google Scholar
  2. H. Cartensen, R. Valk, “Infinite behaviour and fairness in Petri nest”, Advances in Petri nets 188, pp 83–100, 1984Google Scholar
  3. M. Chen, K. Lin, “Dynamic priority ceilings: a concurrency protocol for real-time systems”, Real-time systems 2 (24), pp 325–346, 1990Google Scholar
  4. A. Choquet-Geniet, G. Vidal-Naquet, “Réseaux de Petri et systèmes parallèles”, Editions Armand Colin, 1993Google Scholar
  5. F. Cottet, J.P. Babau, “Off-line temporal analysis of hard real-time applications”, second IEEE Workshop on Real-Time apllications, Washington DC, 1994Google Scholar
  6. K. Jensen, “ High level Peti nets”, Advanced course on Petrinets, Bad-Honnef, 1986Google Scholar
  7. J. Labetoulle, “Some theorems on real-time scheduling”, E. Gelenbe and R. Mahl (eds) Computer Architecture and networks, Amsterdam, 1974Google Scholar
  8. C.L. Liu, J.W. Layland, “Scheduling algorithms for multiprogramming in a hard real-time environment”, Journal of the ACM, 20 (1), pp 46–61, 1973Google Scholar
  9. J.Y.T. Leung, M.L. Merill, “A note on preemptive scheduling of periodic real-time tasks”, Information Processing Letters 11(3), pp 115–118, 1980Google Scholar
  10. P. Martineau, M. Silly, “Evaluation d'algorithmes d'ordonnancement temps réel en présence de ressources partagées”, Lan-ECN internal repport, 94.4, Ecole Centrale de Nantes, 1994Google Scholar
  11. A.K. Mok, M.L. Dertouzos, “Multi processor scheduling in a hard real-time environment”, 7th Texas conference on computer Systems, 1978Google Scholar
  12. R. Rajkumar, “Synchronisation in real-time systems: a priority inheritance approach”, Kluwer Academc Publishers, 1991Google Scholar
  13. W. Reisig, “Petri nets”, EATCS monographs on Theoritical Computer Science, Springer Verlag, 1985Google Scholar
  14. L. Sha, R. Rajkumar, J. Lehockzy, “Priority inheritance protocols: an approach to real time synchronisation”, IEEE transaction computers, vol 39, N∘ 9, 1990Google Scholar
  15. M. Silly, “la tolérance aux fautes dans un système temps-réel à contraintes strictes”, INRIA report, 512, 1986Google Scholar
  16. J.A. Stankovic, “Misconception about Real-TimeComputing: a seriuous problem for the next generation systems”, IEEE Computer Magazine, 21 (10), lpp 0–19, 1988Google Scholar
  17. R. Valk, G. Vidal-Naquet, “Petri nets and regular languages”, Journal of Computer and System Sciences, vol. 23, n∘ 3, Academic press, 1981Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Annie Choquet-Geniet
    • 1
  • Dominique Geniet
    • 1
  • Francis Cottet
    • 1
  1. 1.LISI - ENSMAFuturoscope CedexFrance

Personalised recommendations