Fault-tolerant computer system with three symmetric computers

1978 ◽  
Vol 66 (10) ◽  
pp. 1160-1177 ◽  
Author(s):  
H. Ihara ◽  
K. Fukuoka ◽  
Y. Kubo ◽  
S. Yokota
Keyword(s):  
Computer System ◽  
Fault Tolerant

A fault-tolerant computer system for India’s satellite launch vehicle programmes

Sadhana ◽  
1987 ◽  
Vol 11 (1-2) ◽  
pp. 221-231 ◽  
Author(s):  
D. Basu ◽  
K. V. S. S. Prasad Rao ◽  
S. V. L. A. Varaprasad ◽  
T. Kurian ◽  
T. Jayasri ◽  
...  
Keyword(s):  
Computer System ◽  
Fault Tolerant ◽  
Launch Vehicle ◽  
Satellite Launch Vehicle

Searching for majority with k-tuple queries

2015 ◽  
Vol 07 (02) ◽  
pp. 1550009 ◽  
Author(s):  
Gianluca De Marco ◽  
Evangelos Kranakis
Keyword(s):  
Computer System ◽  
Fault Tolerant ◽  
Computer Systems ◽  
Limited Resources ◽  
Number Of Components ◽  
Diagnostic Property

Diagnosing the quality of components in fault-tolerant computer systems often requires numerous tests with limited resources. It is usually the case that repeated tests on a selected, limited number of components are performed and the results are taken into account so as to infer a diagnostic property of the computer system as a whole. In this paper we abstract fault-tolerant testing as the following problem concerning the color of the majority in a set of colored balls. Given a set of balls each colored with one of two colors, the majority problem is to determine whether or not there is a majority in one of the two colors. In case there is such a majority, the aim is to output a ball of the majority color, otherwise to declare that there is no majority. We propose algorithms for solving the majority problem by repeatedly testing only k-tuple queries. Namely, successive answers of an oracle (which accepts as input only k-tuples) to a sequence of k-tuple queries are assembled so as to determine whether or not the majority problem has a solution. An issue is to design an algorithm which minimizes the number of k-tuple queries needed in order to solve the majority problem on any possible input of n balls. In this paper we consider three querying models: Output, Counting, and General, reflecting the amount and type of information provided by the oracle on each test for a k-tuple.

scholarly journals Fault-tolerant computer system of data storage

2013 ◽  
Author(s):  
И.В. Баскаков ◽  
◽  
А.Ю. Головин ◽  
Keyword(s):  
Computer System ◽  
Data Storage ◽  
Fault Tolerant

DEVELOPMENT OF COMPUTER SYSTEM COMPONENTS IN CRITICAL APPLICATIONS: PROBLEMS, THEIR ORIGINS AND SOLUTIONS

2020 ◽  
Vol 3 (4) ◽  
pp. 252-262
Author(s):  
Andrzej Rucinski ◽  
Igor S. Kovalev ◽  
Myroslav O. Drozd ◽  
Oleksandr V. Drozd ◽  
Viktor V. Antoniuk ◽  
...  
Keyword(s):  
Computer System ◽  
Fault Tolerant ◽  
System Development ◽  
Natural World ◽  
Point Of View ◽  
Functional Safety ◽  
Modern Computer ◽  
Software Model ◽  
Strongly Connected ◽  
Low Efficiency

The article is devoted to analysis of problems of the computer system development in the domain of critical applications. The main trends of this development were highlighted, which consisted in increased demands for performance based on parallelization of calculations, processing of approximate data and ensuring functional safety in accordance with the need for structuring for parallelism and fuzziness of the natural world, as well as with increased responsibility in decisions made. Analysis of problems encountered in implementation of existing solutions was carried out. There was a lag behind theories limited by the model of exact data from the practice of processing approximate data for modern systems receiving initial data from sensors, including safety-related systems. The problems of matrix structures, which underlie the design of modern computer systems and demonstrate low efficiency in performance and power consumption, as well as in providing functional safety, important for critical applications, are disclosed. The application of fault-tolerant solutions as the basis of functional safety and distrust of these solutions, which is manifested in the practice of using dangerous imitation modes, were noted. They recreate emergency conditions to improve the checkability in solving the problem of hidden faults, since a fault-tolerant solution does not become fail-safe when there is a shortage of checkability. An analysis was given to the sources of the problems considered and the possibilities of solving them from the point of view of a resource-based approach, which identifies the problem of hidden faults as a challenge of growth with a lag of components from the development of the system. The role of matrix structures in the backlog of components and the need to solve the problem by repeating the version redundancy for these structures are shown. Method of introduction of version redundancy into matrix structure on the basis of strongly connected versions for solution of problems of fault tolerance and checkability in complex is proposed. The effectiveness of the method is estimated on an example of the iterative array multiplier using its software model.

Fault-tolerant computer system with stepwise negotiating voting

1991 ◽  
Vol 22 (2) ◽  
pp. 1-9 ◽  
Author(s):  
Nobuyasu Kanekawa ◽  
Hideo Maejima ◽  
Hatsuhiko Kato ◽  
Hirokazu Ihara
Keyword(s):  
Computer System ◽  
Fault Tolerant
Sign in / Sign up

Export Citation Format

Share Document