๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Optimal testing policy for a computer system with intermittent faults

โœ Scribed by T. Nakagawa; M. Motoori; K. Yasui

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
223 KB
Volume
27
Category
Article
ISSN
0951-8320

No coin nor oath required. For personal study only.

โœฆ Synopsis

A computer system with intermittent.faults fails with probability p when it is used in hidden.faults. Periodic tests are scheduled at times kT(k = 1, 2 .... ) to detect a hidden.fault. The mean time, the expected number of tests and the expected cost until detection of a fault or system failure are derived, using the theory of Markov renewal proeesses. An optimal testing time T* to minimize the expected cost is discussed. A finite T* is given by a unique solution of an equation.

๐Ÿ“œ SIMILAR VOLUMES

Optimal replacement policy for a series
Optimal replacement policy for a series system with obsolescence
โœ Sophie Mercier; Pierre-Etienne Labeau ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 225 KB ๐Ÿ‘ 1 views

## Abstract Most maintenance policies assume that failed or used components are replaced with identical units. Actually, such a hypothesis neglects the possible obsolescence of the components. When a new, more reliable and less consuming technology becomes available, a decision has to be made as fo

Optimal garbage collection policy for a
Optimal garbage collection policy for a memory-management system with job swapping
โœ Takashi Satow; Kazumi Yasui; Toshio Nakagawa ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 159 KB ๐Ÿ‘ 1 views

A management system for main memory has a great deal of influence on the efficiency of an entire system. In particular, it is important to manage a system with multiprogramming that allocates some jobs to main memory and performs their processing at the same time, because the memory space after some