Advertisement

Testing, Checking, and Hardware Syndrome

  • Igor SchagaevEmail author
  • Eugene Zouev
  • Kaegi Thomas
Chapter

Abstract

In previous chapters, we introduced the processes of checking and testing, the first of the three main processes of Generalized Algorithm of Fault Tolerance—GAFT. In this chapter, we further discuss the process of checking hardware, at first software-based hardware-checking and at second hardware-based checking. For the software-based hardware checking, we show what a software-based test should include, when they are the preferred choice over hardware-based checking schemes, and especially how such tests can be scheduled in the system without interfering with ongoing real-time tasks. Further to support handling of hardware-based checking, we introduce a new system condition descriptor—so-called a syndrome, and illustrate how it can be used as a mechanism to signal to the operating system the hardware condition, including manifestation of detected error. We then show the steps the runtime system performs to eliminate the fault and in case of permanent errors how the software can reconfigure the hardware to exclude the faulty element. We also explain in which cases software has to adapt to the new hardware topology. We start by explaining how software-based checks can be used to detect hardware faults. Runtime systems use online or offline scheduling mechanisms for task management of programs—own—system software ones and user application ones. Since [1, 2, 3, 4] it is expected that runtime system provides a special session of tasks scheduling (offline or online during execution) for the purposes of diagnostic of hardware conditions—recall Apple and Microsoft system starting delays. Later for some systems that operate in domain of real-time monitoring scheduling of tasks, critical in time of execution especially criticality of hardware availability and efficiency of process scheduling become crucial. In turn, testing itself becomes “hot” in terms of required time and coverage of hardware. Thus in this chapter, we initially analyze simple sequences of testing of hardware elements of computer systems. Further, we introduce a concept of transparent for user application procedure of hardware testing. This enables to prove integrity of computer system hardware, and guarantee it within a reasonable time, without delay of service of execution of user tasks.

References

  1. 1.
    Kirby W et al (1985) The NMFECC cray time-sharing system. Softw Pract Exper 15(1):87–103CrossRefGoogle Scholar
  2. 2.
    Serlin O (1984) Fault-tolerant systems in commercial applications. Computer C 7(8):19–30Google Scholar
  3. 3.
    Blazewicz J et al (2007) Handbook on scheduling, from theory to applications. Springer, Berlin, HeidelbergzbMATHGoogle Scholar
  4. 4.
    Ingo M (2002) Linux kernel archive. World Wide Web electronic publication, January 03, 2002Google Scholar
  5. 5.
    Bogdanov J, Schagaev I (1990) Sliding slotting diagnosis in multiprocessors. In: IMECO congress proceedings, pp 141–150Google Scholar
  6. 6.
    Garey M, Johnson D (1979) Computers and in-tractability: a guide to the theory of NP-completeness. W.H. Freeman and CompanyGoogle Scholar
  7. 7.
    Knuth D (1998) The art of computer programming 3. Sorting and searching, vol III. Addison-Wesley Longman, AmsterdamzbMATHGoogle Scholar
  8. 8.
    Johannes M (2002) The active object system-design and multiprocessor implementation. ETH Zurich, ZurichGoogle Scholar
  9. 9.
    Liu CL, Layland J (1973) Scheduling algorithms for multiprogramming in a hard-real-time environment. J ACM 20(1):46–61MathSciNetCrossRefGoogle Scholar
  10. 10.
    Castano V, Schagaev I (2014) Resilient computer system design. Springer. ISBN 978-3-319-15069-7Google Scholar
  11. 11.
    Blaeser L, Monkman S, Schagaev I (2014) Evolving systems Worldcomp 2014. In: Proceedings of the international conference on foundations of computer science FCS’14, 2014. CSREA Press. ISBN 1-60132-270-4Google Scholar
  12. 12.
    Monkman S, Schagaev I (2013) Redundancy + Reconfigurability = Recoverability Electronics, 2, pp 212–233. ISSN 2079-9292.  https://doi.org/10.3390/electronics2030212CrossRefGoogle Scholar
  13. 13.
    Buhanova G, Schagaev I (2001) Comparative study of fault tolerant RAM structures. In: Proceedings of IEEE dependendable system networks Conference, Guetebog, July 10, 2001. https://www.academia.edu/7140850/

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.IT-ACS LtdStevenageUK
  2. 2.Department of InformaticsTechnopolisInnopolis, KazanRussia

Personalised recommendations