iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://unpaywall.org/10.1007/S10617-013-9120-7
Reliability analysis of real-time fault-tolerant task models | Design Automation for Embedded Systems Skip to main content
Springer Nature Link
Log in

Reliability analysis of real-time fault-tolerant task models

  • Published:
Design Automation for Embedded Systems Aims and scope Submit manuscript

Abstract

One notable advantage of Model-Driven Architecture (MDA) method is that software developers could do sufficient analysis and tests on software models in the design phase, which helps construct high confidence on the expected software behaviors and performance, especially for safety-critical real-time software. Most existing literature of reliability analysis ignores the effects from those deadline requirements of tasks which are critical properties for real-time software and thus cannot be ignored.

Considering the contradictory relationship between the deadline requirements and time costs of fault tolerance in real-time tasks, in this paper, we present a novel reliability model, which takes schedulability as one of the major factors affecting the reliability, to analyze reliability of the task execution model in real-time software design phase. The tasks in this reliability model has no restrictions on their distributions and thus could be distributed on a multiprocessor or on a distributed system. Furthermore, the tasks also define arrival rates of faults and fault-tolerant mechanisms to model the occurrences of non-permanent faults and the corresponding time costs of fault handling. By analyzing the probability of tasks still being schedulable in the worst-case execution scenario with faults occurring, reliability and schedulability are combined into an unified analysis framework, and two algorithms for reliability analysis are given. To make this reliability model more pragmatic, we also present an estimation technique for estimating the fault arrival rate of each task. We show through two case studies respectively the detailed derivation process under static-priority scheduling in a multiprocessor system and in the design process of avionics software, and then analyze the factors affecting the reliability analysis by setting up simulation experiments. When no assumptions of fault occurrences made on the task model, this reliability model regresses to a generic schedulability model.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Algorithm 1
Algorithm 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

Notes

  1. T i ≺T j is defined as that task T j cannot be released until task T i finishes.

References

  1. OMG model driven architecture. http://www.omg.org/mda/

  2. Avionics application software standard interface-ARINC. Specification 653P1-2 (2006)

  3. Agresti WW, Evanco WM (1992) Projecting software defects from analyzing Ada designs. IEEE Trans Softw Eng 18(11):988–997

    Article  Google Scholar 

  4. Audsley NC, Burns A, Richardson M, Tindell K, Wellings AJ (1993) Applying new scheduling theory to static priority pre-emptive scheduling. Softw Eng J 8(5):284–292

    Article  Google Scholar 

  5. Bini E, Buttazzo GC, Giuseppe M (2003) Rate monotonic scheduling: the hyperbolic bound. IEEE Trans Comput 52(7):933–942

    Article  Google Scholar 

  6. Castillo X, McConnel SR, Siewiorek DP (1982) Derivation and caliberation of a transient error reliability model. IEEE Trans Comput C-31(7):658–671

    Article  Google Scholar 

  7. Chevochot P, Puaut I (1999) Scheduling fault-tolerant distributed hard real-time tasks independently of the replication strategies. In: Proc. of the 6th international conference on real-time computing systems and applications, pp 356–363

    Google Scholar 

  8. Duane JT (1964) Learning curve approach to reliability monitoring. IEEE Trans Aerosp 2(2):563–566

    Article  Google Scholar 

  9. Eles P, Izosimov V, Pop P, Peng Z (2008) Synthesis of fault-tolerant embedded systems. In: Proc. of the conference on design, automation and test in Europe, pp 1117–1122

    Google Scholar 

  10. Gaffney JE, Pietrolewicz J (1990) An automated model for software early prediction(SWEEP). In: Proc. of the 13th Minnowbrook workshop on software reliability

    Google Scholar 

  11. Ghosh S, Melhem R, Mosse D (1994) Fault-tolerant scheduling on a hard real-time multiprocessor system. In: Proc. of the 8th international symposium on parallel processing, pp 775–782

    Chapter  Google Scholar 

  12. Goel AL, Okumoto K (1979) Time-dependent error-detection rate model for software and other performance measures. IEEE Trans Reliab R-28(S):206–211

    Article  Google Scholar 

  13. Goseva-Popstojanova K, Trivedi K, Mathur AP (2000) How different architecture based software reliability models are related? In: Proc. of the fast abstracts 11th IEEE international symposium on software reliability engineering

    Google Scholar 

  14. Institute of Electrical & Electronics Engineers (1991) Standard glossary of software engineering terminology. IEEE Std. 729–1991

  15. Lee Y, Kim D, Younis M, Zhou J (1998) Partition scheduling in apex runtime environment for embedded avionics software. In: Proc. of the international conference on real-time computing systems and applications, pp 103–109

    Google Scholar 

  16. Lima G, Burns A (2005) Scheduling fixed-priority hard real-time tasks in the presence of faults. In: Proc. of the 2nd Latin-American conference on dependable computing, pp 154–173

    Google Scholar 

  17. Littlewood B (1980) The Littlewood-Verrall model for software reliability compared with some rivals. J Syst Softw 1(3):251–258

    Google Scholar 

  18. Liu C, Layland J (1973) Scheduling algorithms for multiprogramming in a hard-real-time environment. J ACM 20(1):46–61

    Article  MATH  MathSciNet  Google Scholar 

  19. Liu X (2009) Fault-tolerant scheduling A model proposal for multiple transient faults. Master’s thesis, Chalmers University of Technology, Sweden

  20. Moranda PB (1979) Event-altered rate models for general reliability analysis. IEEE Trans Reliab R-28(5):376–381

    Article  Google Scholar 

  21. Musa JD (1979) Validity of execution-time theory of software reliability. IEEE Trans Reliab R-28(3):181–191

    Article  Google Scholar 

  22. Ohba M (1984) Software reliability analysis models. IBM J Res Dev 21(4):428–443

    Article  Google Scholar 

  23. Pandya M, Malek M (1998) Minimum achivable utilization for fault-tolerant processing of periodic tasks. IEEE Trans Comput 47(10):1102–1112

    Article  Google Scholar 

  24. Qin X, Jiang H (2006) A novel fault-tolerant scheduling algorithm for precedence constrained tasks in real-time heterogeneous systems. Parallel Comput 32(5):331–356

    Article  MathSciNet  Google Scholar 

  25. Schneidewind NF (1975) Analysis of error processes in computer software. Sigplan Note 10(6):337–346

    Article  Google Scholar 

  26. Shatz S, Wang J, Goto M (1992) Task allocation for maximizing reliability of distributed computer systems. IEEE Trans Comput 41(9):1156–1168

    Article  Google Scholar 

  27. Shin KG, Lin T, Lee Y (1987) Optimal checkpointing of real-time tasks. IEEE Trans Comput C-36(11):1328–1341

    Article  Google Scholar 

  28. Smidts C, Stutzke M, Stoddard RW (1998) Software reliability modeling: an approach to early reliability prediction. IEEE Trans Reliab 47(3):268–278

    Article  Google Scholar 

  29. Tindell K, Burns A, Wellings A (1994) An extendible approach for analysing fixed priority hard real-time tasks. Real-Time Syst 6(1):133–151

    Article  Google Scholar 

  30. Tindell K, Clark J (1994) Holistic schedulability analysis for distributed hard real-time systems. Microprocess Microprogram 40(2–3):117–134

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China

    Shenglin Gui & Lei Luo

Authors
  1. Shenglin Gui
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lei Luo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shenglin Gui.

Additional information

The research presented in this paper has been partially supported by the Fundamental Research Funds for the Central Universities No. ZYGX2012J080 and Applied Basic Research Programs of Science and Technology Department of Sichuan Province No. 2013JY0002.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gui, S., Luo, L. Reliability analysis of real-time fault-tolerant task models. Des Autom Embed Syst 17, 87–107 (2013). https://doi.org/10.1007/s10617-013-9120-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10617-013-9120-7

Keywords

Search

Navigation