A general-purpose multi-micro-system with high fault-tolerance and unlimited system-capacity

1980 ◽  
Vol 6 (6) ◽  
pp. 388-390 ◽  
Author(s):  
R Männer ◽  
W Schneider ◽  
B De Luigi ◽  
K Posner
Keyword(s):  
Fault Tolerance ◽  
General Purpose ◽  
System Capacity

Optimizing Fault Tolerance for Multi-Processor System-on-Chip

2011 ◽  
pp. 66-91 ◽  
Author(s):  
Dimitar Nikolov ◽  
Mikael Väyrynen ◽  
Urban Ingelsson ◽  
Virendra Singh ◽  
Erik Larsson
Keyword(s):  
Fault Tolerance ◽  
Error Probability ◽  
Fault Tolerant ◽  
General Purpose ◽  
System On Chip ◽  
Probability Estimation ◽  
Communication Overhead ◽  
Mathematical Framework ◽  
Safety Critical ◽  
On Chip

While the rapid development in semiconductor technologies makes it possible to manufacture integrated circuits (ICs) with multiple processors, so called Multi-Processor System-on-Chip (MPSoC), ICs manufactured in recent semiconductor technologies are becoming increasingly susceptible to transient faults, which enforces fault tolerance. Work on fault tolerance has mainly focused on safety-critical applications; however, the development of semiconductor technologies makes fault tolerance also needed for general-purpose systems. Different from safety-critical systems where meeting hard deadlines is the main requirement, it is for general-purpose systems more important to minimize the average execution time (AET). The contribution of this chapter is two-fold. First, the authors present a mathematical framework for the analysis of AET. Their analysis of AET is performed for voting, rollback recovery with checkpointing (RRC), and the combination of RRC and voting (CRV) where for a given job and soft (transient) error probability, the authors define mathematical formulas for each of the fault-tolerant techniques with the objective to minimize AET while taking bus communication overhead into account. And, for a given number of processors and jobs, the authors define integer linear programming models that minimize AET including communication overhead. Second, as error probability is not known at design time and it can change during operation, they present two techniques, periodic probability estimation (PPE) and aperiodic probability estimation (APE), to estimate the error probability and adjust the fault tolerant scheme while the IC is in operation.

Toward Trustworthy Web Services Coordination

2018 ◽  
pp. 8056-8065
Author(s):  
Wenbing Zhao
Keyword(s):  
Fault Tolerance ◽  
Web Services ◽  
General Purpose ◽  
Byzantine Fault Tolerance ◽  
Intrusion Tolerance ◽  
Straightforward Manner ◽  
Byzantine Fault ◽  
Application Semantics ◽  
Application Aware

In this article, we present an overview of our recent works on enhancing the trustworthiness of Web services coordination for business activities and transactions. The approach is based on what we call application-aware Byzantine fault tolerance. We argue that it is impractical to apply general-purpose Byzantine fault tolerance algorithms for such systems in a straightforward manner. Instead, by exploiting the application semantics, much lighter weight solutions can be designed to enhance intrusion tolerance, and hence the trustworthiness of systems that require Web services coordination.

Toward Trustworthy Web Services Coordination

2019 ◽  
pp. 1801-1812
Author(s):  
Wenbing Zhao
Keyword(s):  
Fault Tolerance ◽  
Web Services ◽  
General Purpose ◽  
Byzantine Fault Tolerance ◽  
Intrusion Tolerance ◽  
Straightforward Manner ◽  
Byzantine Fault ◽  
Application Semantics ◽  
Application Aware

In this chapter, the authors present an overview of recent works on enhancing the trustworthiness of web services coordination for business activities and transactions. The approach is based on what they call application-aware Byzantine fault tolerance. They argue that it is impractical to apply general-purpose Byzantine fault tolerance algorithms for such systems in a straightforward manner. Instead, by exploiting the application semantics, much lighter weight solutions can be designed to enhance intrusion tolerance and, hence, the trustworthiness of systems that require web services coordination.

scholarly journals Applying quantum algorithms to constraint satisfaction problems

Quantum ◽  
2019 ◽  
Vol 3 ◽  
pp. 167 ◽  
Author(s):  
Earl Campbell ◽  
Ankur Khurana ◽  
Ashley Montanaro
Keyword(s):  
Fault Tolerance ◽  
Constraint Satisfaction ◽  
Quantum Algorithms ◽  
Quantum Algorithm ◽  
General Purpose ◽  
Constraint Satisfaction Problems ◽  
Graph Colouring ◽  
Desktop Computer ◽  
Complete Problems ◽  
Problem Instances

Quantum algorithms can deliver asymptotic speedups over their classical counterparts. However, there are few cases where a substantial quantum speedup has been worked out in detail for reasonably-sized problems, when compared with the best classical algorithms and taking into account realistic hardware parameters and overheads for fault-tolerance. All known examples of such speedups correspond to problems related to simulation of quantum systems and cryptography. Here we apply general-purpose quantum algorithms for solving constraint satisfaction problems to two families of prototypical NP-complete problems: boolean satisfiability and graph colouring. We consider two quantum approaches: Grover's algorithm and a quantum algorithm for accelerating backtracking algorithms. We compare the performance of optimised versions of these algorithms, when applied to random problem instances, against leading classical algorithms. Even when considering only problem instances that can be solved within one day, we find that there are potentially large quantum speedups available. In the most optimistic parameter regime we consider, this could be a factor of over 105 relative to a classical desktop computer; in the least optimistic regime, the speedup is reduced to a factor of over 103. However, the number of physical qubits used is extremely large, and improved fault-tolerance methods will likely be needed to make these results practical. In particular, the quantum advantage disappears if one includes the cost of the classical processing power required to perform decoding of the surface code using current techniques.

F-DRARE

2012 ◽  
pp. 263-276
Author(s):  
Fahad Bin Tariq ◽  
Sandeep Korrapati
Keyword(s):  
Fault Tolerance ◽  
General Purpose ◽  
Constrained Systems ◽  
Global Network ◽  
Time Constraints ◽  
Global Networks ◽  
Runtime Adaptation ◽  
General Purpose Processor ◽  
Difficult Challenge

Modern systems are designed to have various non-functional attributes such as fault tolerance, robustness, et cetera. The ability of systems to adapt while being connected to a global network as in Cyber Physical Systems, presents new opportunities. Extra-functional qualities may be extended to nodes in the network that initially were devoid of them. It is inevitable that such vast global networks will consist of computationally constrained units. Extending such computationally constrained nodes with the ability to adapt is already a difficult challenge, which becomes more difficult when added with the constraint of timely behavior. In this chapter, the authors present an approach to tackle the issue of runtime adaptation on computationally constrained systems with real-time constraints. The focus is on systems with only a single general purpose processor, with the responsibility to run the system and application software. The authors introduce their framework towards this aim, followed by the architecture and a case study.

PENGARUH LATIHAN RANGE OF MOTION (ROM) AKTIF ASSITIF TERHADAP RENTANG GERAK SENDI PADA LANSIA YANG MENGALAMI IMMOBILISASI FISIK

2019 ◽  
Vol 13 (2) ◽  
Author(s):  
Andri Setyorini ◽  
Niken Setyaningrum
Keyword(s):  
Range Of Motion ◽  
Human Life ◽  
The Elderly ◽  
General Purpose ◽  
Test Statistic ◽  
Physical Mobility ◽  
Motion Exercise ◽  
The One ◽  
The Individual ◽  
Active Training

Background: Elderly is the final stage of the human life cycle, that is part of the inevitable life process and will be experienced by every individual. At this stage the individual undergoes many changes both physically and mentally, especially setbacks in various functions and abilities he once had. Preliminary study in Social House Tresna Wreda Yogyakarta Budhi Luhur Units there are 16 elderly who experience physical immobilization. In the social house has done various activities for the elderly are still active, but the elderly who experienced muscle weakness is not able to follow the exercise, so it needs to do ROM (Range Of Motion) exercise.   Objective: The general purpose of this research is to know the effect of Range Of Motion (ROM) Active Assitif training to increase the range of motion of joints in elderly who experience physical immobility at Social House of Tresna Werdha Yogyakarta unit Budhi Luhur.   Methode: This study was included in the type of pre-experiment, using the One Group Pretest Posttest design in which the range of motion of the joints before (pretest) and posttest (ROM) was performed  ROM. Subjects in this study were all elderly with impaired physical mobility in Social House Tresna Wreda Yogyakarta Unit Budhi Luhur a number of 14 elderly people. Data analysis in this research use paired sample t-test statistic  Result: The result of this research shows that there is influence of ROM (Range of Motion) Active training to increase of range of motion of joints in elderly who experience physical immobility at Social House Tresna Wredha Yogyakarta Unit Budhi Luhur.  Conclusion: There is influence of ROM (Range of Motion) Active training to increase of range of motion of joints in elderly who experience physical immobility at Social House Tresna Wredha Yogyakarta Unit Budhi Luhur.

Sign in / Sign up

Export Citation Format

Share Document