Extending RT-Linux to support flexible hard real-time systems with optional components

  • A. Terrasa
  • A. Espinosa
  • A. García-Fornes
Refereed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1474)

Abstract

This paper describes a framework that provides a task programming model with optional components and the appropriate operating system mechanisms for supporting it. The approach provides 100% guarantees to hard real-time tasks using fixed priority pre-emptive scheduling. Optional components, which increase the utility of the guaranteed tasks, are executed when spare processor capacity is available. The framework has been developed extending the existing RT-Linux capabilities. Furthermore, the design of these kernel extensions have been proved to be predictable, in such a way that it is possible to perform a schedulability analysis of the entire system, including kernel overheads.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Aud95]
    Audsley, N.C., Burns, A., Davis, R., Tindell, K., and Wellings, J. (1995). “Fixed priority pre-emptive scheduling: an historical perspective”. Real-Time Systems, Volume 8, 173–198.CrossRefGoogle Scholar
  2. [Bar96]
    Barabanov, M. and Yodaiken, V. (1996). “Real-Time Linux”. New Mexico Institute of Mining and Technology.Google Scholar
  3. [Dav93]
    Davis, R.I., Tindell, K.W., and Burns, A. (1993). “Scheduling Slack Time in Fixed Priority Preemptive Systems”. Proc. Real-Time Systems Symposium, Raleigh-Durham, North Carolina, December 1–3, pp. 222–231, IEEE Computer Society Press.Google Scholar
  4. [Dav94]
    Davis, R.I. (1994). “Approximate Slack Stealing Algorithms for Fixed Priority Pre-emptive Systems”. Real-Time Systems Research Group. Department of Computer Science. University of York, UK. Report number YCS-93-217.Google Scholar
  5. [Gar96a]
    Garcia-Fornes, A., Hassan, H., and Crespo, A. (1996). “Strategies for scheduling optional tasks in intelligent real-time environments”. Journal of Systems Architecture, Volume 42, pp.391–407.CrossRefGoogle Scholar
  6. [Gar96b]
    Garcia-Fornes, A., Terrasa, A., and Botti, V. (1996). “Engineering a tool for building hard predictable real-time artificial intelligent systems”. Proc. of the 21th IFAC/IFIP Workshop on Real-Time Programming, Gramado, Brazil.Google Scholar
  7. [Gar97]
    Garcia-Fornes, A., Terrasa, A., Botti, V., and Crespo, A. (1997). “Analyzing the schedulability of hard real-time artificial intelligence systems”. Engineering Applications of Artificial Intelligence, Volume 10, no. 4, pp.369–377.CrossRefGoogle Scholar
  8. [Nat95]
    Natarajan, S.(editor) (1995). “Imprecise and Approximate Computation”. Kluwer Academic Publishers. ISBN 0-7923-9579-4.Google Scholar
  9. [Sha90]
    Sha, L., Rajkumar, R., and Lehoczky, J.P. (1990). “Priority inheritance protocols: An approach to Real-Time Synchronization”. IEEE Transactions on Computers, Volume 39 no. 9, pp. 1175–1185.MathSciNetCrossRefGoogle Scholar
  10. [Sta93]
    Stankovic, J. and Ramamritham, K. (1993). “Advances in Real-Time Systems”. IEEE Computer Society Press. ISBN 0-8186-3792-7.Google Scholar

Copyright information

© Springer-Verlag 1998

Authors and Affiliations

  • A. Terrasa
    • 1
  • A. Espinosa
    • 1
  • A. García-Fornes
    • 1
  1. 1.Departamento de Sistemas Informáticos y ComputaciónUniversidad Politécnica de ValenciaValenciaSpain

Personalised recommendations