Skip to main content
SpringerLink
Log in

Scheduling Fixed-Priority Hard Real-Time Tasks in the Presence of Faults

  • Conference paper
Book cover Dependable Computing (LADC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3747))

Included in the following conference series:

Abstract

We describe an approach to scheduling hard real-time tasks taking into account fault scenarios. All tasks are scheduled at run-time according to their fixed priorities, which are determined off-line. Upon error-detection, special tasks are released to perform error-recovery actions. We allow error-recovery actions to be executed at higher priority levels so that the fault resilience of the task set can be increased. To do so, we extend the well known response time analysis technique and describe a non-standard priority assignment policy. Results from simulation indicate that the fault resilience of the task sets can be significantly increased by using the proposed approach.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Audsley, N.C., Burns, A., Richardson, M., Tindell, K., Wellings, A.J.: Applying New Scheduling Theory to Static Priority Pre-Emptive Scheduling. Software Engineering Journal 8(5), 284–292 (1993)

    Article  Google Scholar 

  2. Bertossi, A.A., Mancini, L.V., Rossini, F.: Fault-Tolerant Rate-Monotonic First-Fit Scheduling in Hard-Real-Time Systems. IEEE Transaction on Parallel and Distributed Systems 10(9), 934–945 (1999)

    Article  Google Scholar 

  3. Burns, A., Davis, R.I., Punnekkat, S.: Feasibility Analysis of Fault-Tolerant Real-Time Task Sets. In: Proc. of the Euromicro Real-Time Systems Workshop, pp. 29–33. IEEE Computer Society Press, Los Alamitos (1996)

    Chapter  Google Scholar 

  4. Burns, A., Wellings, A.J.: Real-Time Systems and Programming Languages, 3rd edn. Addison-Wesley, Reading (2001)

    Google Scholar 

  5. Caccamo, M., Buttazzo, G.: Optimal Scheduling for Fault-Tolerant and Firm Real-Time Systems. In: Proc. of the 5th Conference on Real-Time Computing and Applications (RTCSA), pp. 223–231 (1998)

    Google Scholar 

  6. Ghosh, S., Melhem, R.G., Mossé, D.: Enhancing Real-Time Schedules to Tolerate Transient Faults. In: Proc. of the 16th Real-Time Systems Symposium (RTSS), pp. 120–129. IEEE Computer Society Press, Los Alamitos (1995)

    Chapter  Google Scholar 

  7. Ghosh, S., Melhem, R.G., Mossé, D., Sarma, J.S.: Fault-Tolerant Rate-Monotonic Scheduling. Real-Time Systems 15(2), 149–181 (1998)

    Article  Google Scholar 

  8. Kandasamy, N., Hayes, J.P., Murray, B.T.: Tolerating Transient Faults in Statically Scheduled Safety-Critical Embedded Systems. In: Proc. of the 18th IEEE Symposium on Reliable Distributed Systems (SRDS), pp. 212–221 (1999)

    Google Scholar 

  9. Kieckhafer, R.M., Walter, C.J., Finn, A.M., Thambidurai, P.M.: The MAFT Architecture for Distributed Fault Tolerance. IEEE Transactions on Computers 37(4), 398–405 (1988)

    Article  Google Scholar 

  10. Kopetz, H.: Real-Time Systems Design for Distributed Embedded Applications. Kluwer Academic Publishers, Dordrecht (1997)

    MATH  Google Scholar 

  11. Krishna, C.M., Shin, K.G.: On Scheduling Tasks with a Quick Recovery from Failure. IEEE Transactions on Computers 35(5), 448–455 (1986)

    Article  MATH  Google Scholar 

  12. Liberato, F., Melhem, R.G., Mossé, D.: Tolerance to Multiple Transient Faults for Aperiodic Tasks in Hard Real-Time Systems. IEEE Transactions on Computers 49(9), 906–914 (2000)

    Article  Google Scholar 

  13. Liestman, L., Campbell, R.H.: A Fault-Tolerant Scheduling Problem. IEEE Transaction on Software Engineering 12(11), 1089–1095 (1986)

    MATH  Google Scholar 

  14. Lima, G.M.A.: Fault Tolerance in Fixed-Priority Hard Real-Time Distributed Systems. PhD thesis, Deptartment of Computer Science, University of York (2003)

    Google Scholar 

  15. Lima, G.M.A., Burns, A.: An Optimal Fixed-Priority Assignment Algorithm for Supporting Fault Tolerant Hard Real-Time Systems. IEEE Transaction on Computers 52(10), 1332–1346 (2003)

    Article  Google Scholar 

  16. Poledna, S.: Fault-Tolerant Real-Time Systems: The Problem of Replica Determinism. Kluwer Academic Publishers, Dordrecht (1996)

    MATH  Google Scholar 

  17. Poledna, S., Burns, A., Wellings, A.J., Barrett, P.: Replica Determinism and Flexible Scheduling in Hard Real-time Dependable Systems. IEEE Transsactions on Computers 49(2), 100–111 (2000)

    Article  Google Scholar 

  18. Punnekkat, S.: Schedulability Analysis for Fault Tolerant Real-Time Systems. PhD thesis, Department of Computer Science, University of York (1997)

    Google Scholar 

  19. Ramos-Thuel, S., Strosnider, J.K.: The Transient Server Approach to Scheduling Time-Critical Recovery Operations. In: Proc. of the 12th Real-Time Systems Symposium (RTSS), pp. 286–295. IEEE Computer Society Press, Los Alamitos (1991)

    Google Scholar 

  20. Schneider, F.: Replication Management Using the State-Machine Approach. In: Mullender, S. (ed.) Distributed Systems, ch. 7, 2nd edn., Addison-Wesley, Reading (1993)

    Google Scholar 

  21. Veríssimo, P., Rodrigues, L.: Distributed Systems for Systems Architects. Kluwer Academic Publishers, Dordrecht (2001)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Distributed Systems Lab (LaSiD), Department of Computer Science (DCC), Federal University of Bahia (UFBA), Salvador, BA, Brazil

    George Lima

  2. Real-Time Systems Research Group, Department of Computer Science, University of York, York, UK

    Alan Burns

Authors
  1. George Lima
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alan Burns
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Pontifícia Universidade Católica do Paraná (PUCPR), PPGIA, Paraná, Brazil

    Carlos Alberto Maziero

  2. Dept. Engenharia Informática/CISUC Universidade de Coimbra - Polo II, 3030-397, Coimbra, Portugal

    João Gabriel Silva

  3. Universidade Federal da Bahia (UFBA), Prédio do CPD, Campus de Ondina, Av. Ademar de Barros, CEP 40.170-110, Salvador, BA, Brazil

    Aline Maria Santos Andrade  & Flávio Morais de Assis Silva  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lima, G., Burns, A. (2005). Scheduling Fixed-Priority Hard Real-Time Tasks in the Presence of Faults. In: Maziero, C.A., Gabriel Silva, J., Andrade, A.M.S., de Assis Silva, F.M. (eds) Dependable Computing. LADC 2005. Lecture Notes in Computer Science, vol 3747. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11572329_14

Download citation

  • DOI: https://doi.org/10.1007/11572329_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29572-3

  • Online ISBN: 978-3-540-32092-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation