Transient-fault tolerant VHDL descriptions: a case-study for area overhead analysis

Author(s):  
F. Vargas ◽  
A. Amory
2021 ◽  
Vol 20 (5s) ◽  
pp. 1-22
Author(s):  
Haoran Li ◽  
Chenyang Lu ◽  
Christopher D. Gill

Fault-tolerant coordination services have been widely used in distributed applications in cloud environments. Recent years have witnessed the emergence of time-sensitive applications deployed in edge computing environments, which introduces both challenges and opportunities for coordination services. On one hand, coordination services must recover from failures in a timely manner. On the other hand, edge computing employs local networked platforms that can be exploited to achieve timely recovery. In this work, we first identify the limitations of the leader election and recovery protocols underlying Apache ZooKeeper, the prevailing open-source coordination service. To reduce recovery latency from leader failures, we then design RT-Zookeeper with a set of novel features including a fast-convergence election protocol, a quorum channel notification mechanism, and a distributed epoch persistence protocol. We have implemented RT-Zookeeper based on ZooKeeper version 3.5.8. Empirical evaluation shows that RT-ZooKeeper achieves 91% reduction in maximum recovery latency in comparison to ZooKeeper. Furthermore, a case study demonstrates that fast failure recovery in RT-ZooKeeper can benefit a common messaging service like Kafka in terms of message latency.


Author(s):  
P Quiñones-Reyes ◽  
H Benítez-Pérez ◽  
E Mendez-Monroy ◽  
F Cárdenas-Flores ◽  
F García-Nocetti

Electronics ◽  
2019 ◽  
Vol 8 (3) ◽  
pp. 332 ◽  
Author(s):  
Tooba Arifeen ◽  
Abdus Hassan ◽  
Jeong-A Lee

Approximate Triple Modular Redundancy has been proposed in the literature to overcome the area overhead issue of Triple Modular Redundancy (TMR). The outcome of TMR/Approximate TMR modules serves as the voter input to produce the final output of a system. Because the working principle of Approximate TMR conditionally allows one of the approximate modules to differ from the original circuit, it is critical for Approximate TMR that a voter not only be tolerant toward its internal faults but also toward faults that occur at the voter inputs. Herein, we present a novel compact voter for Approximate TMR using pass transistors and quadded transistor level redundancy to achieve a higher fault masking. The design also targets a better Quality of Circuit (QoC), a new metric which we have proposed for highlighting the ability of a circuit to fully mask all possible internal faults for an input vector. Comparing the fault masking features with those of existing works, the proposed voter delivered upto 45.1%, 62.5%, 26.6% improvement in Fault Masking Ratio (FMR), QoC, and reliability, respectively. With respect to the electrical characteristics, our proposed voter can achieve an improvement of up to 50% and 56% in terms of the transistor count and power delay product, respectively.


Author(s):  
Nidhal Mahmud

The use of robotics systems is increasingly widespread and spans a variety of application areas. From manufacturing, to surgeries, to chemical, these systems can be required to perform difficult, dangerous and critical tasks. The nature of such tasks places high demands on the dependability of robotics systems. Fault tree analysis is among the most often used dependability assessment techniques in various domains of robotics. However, there is still a lack of adjustment methods that can efficiently cope with the sequential dependencies among the components of such systems. In this paper, the authors first introduce some relevant techniques to analyze the dependability of robotics systems. Thereafter, an experience from research projects such as MAENAD (European automotive project investigating development of dependable Fully Electric Vehicles) is presented; emphasis is put on a novel approach to synthesizing fault trees from the components and that is suitable for modern high-technology robotics. Finally, the benefits of the approach are highlighted by using a fault-tolerant case study.


Author(s):  
Guangda Zhang ◽  
Wei Song ◽  
Jim D. Garside ◽  
Javier Navaridas ◽  
Zhiying Wang

Energies ◽  
2020 ◽  
Vol 13 (1) ◽  
pp. 239
Author(s):  
Piotr Hadaj ◽  
Dominik Strzałka

In this paper, a case study is conducted based on the real data obtained from the local Distribution System Operator (DSO) of electrical energy. The analyzed network represents connections and high-voltage switchgears of 110 kV. Selected graph parameters—vertex degree distribution, the average vertex degree, the graph density, network efficiency, the clustering coefficient, the average path length, and the graph diameter were examined, taking into account that in the analysis, some nodes were removed due to the different failures. For each failure, the possible effects on network parameters were tested. As a final result, it was shown that in the analyzed case, the removal of only five nodes could cause a significant (almost four times) fall of graph efficiency. In turn, this means that the whole analyzed network cannot be considered as a fault-tolerant.


Sign in / Sign up

Export Citation Format

Share Document