15,063 research outputs found
Transient fault behavior in a microprocessor: A case study
An experimental analysis is described which studies the susceptibility of a microprocessor based jet engine controller to upsets caused by current and voltage transients. A design automation environment which allows the run time injection of transients and the tracing from their impact device to the pin level is described. The resulting error data are categorized by the charge levels of the injected transients by location and by their potential to cause logic upsets, latched errors, and pin errors. The results show a 3 picoCouloumb threshold, below which the transients have little impact. An Arithmetic and Logic Unit transient is most likely to result in logic upsets and pin errors (i.e., impact the external environment). The transients in the countdown unit are potentially serious since they can result in latched errors, thus causing latent faults. Suggestions to protect the processor against these errors, by incorporating internal error detection and transient suppression techniques, are also made
An efficient logic fault diagnosis framework based on effect-cause approach
Fault diagnosis plays an important role in improving the circuit design process and the
manufacturing yield. With the increasing number of gates in modern circuits, determining
the source of failure in a defective circuit is becoming more and more challenging.
In this research, we present an efficient effect-cause diagnosis framework for
combinational VLSI circuits. The framework consists of three stages to obtain an accurate
and reasonably precise diagnosis. First, an improved critical path tracing algorithm is
proposed to identify an initial suspect list by backtracing from faulty primary outputs
toward primary inputs. Compared to the traditional critical path tracing approach, our
algorithm is faster and exact. Second, a novel probabilistic ranking model is applied to
rank the suspects so that the most suspicious one will be ranked at or near the top. Several
fast filtering methods are used to prune unrelated suspects. Finally, to refine the diagnosis,
fault simulation is performed on the top suspect nets using several common fault models.
The difference between the observed faulty behavior and the simulated behavior is used to rank each suspect. Experimental results on ISCAS85 benchmark circuits show that this
diagnosis approach is efficient both in terms of memory space and CPU time and the
diagnosis results are accurate and reasonably precise
RELEASE: A High-level Paradigm for Reliable Large-scale Server Software
Erlang is a functional language with a much-emulated model for building reliable distributed systems. This paper outlines the RELEASE project, and describes the progress in the first six months. The project aim is to scale the Erlang’s radical concurrency-oriented programming paradigm to build reliable general-purpose software, such as server-based systems, on massively parallel machines. Currently Erlang has inherently scalable computation and reliability models, but in practice scalability is constrained by aspects of the language and virtual machine. We are working at three levels to address these challenges: evolving the Erlang virtual machine so that it can work effectively on large scale multicore systems; evolving the language to Scalable Distributed (SD) Erlang; developing a scalable Erlang infrastructure to integrate multiple, heterogeneous clusters. We are also developing state of the art tools that allow programmers to understand the behaviour of massively parallel SD Erlang programs. We will demonstrate the effectiveness of the RELEASE approach using demonstrators and two large case studies on a Blue Gene
What is the Path to Fast Fault Simulation?
Motivated by the recent advances in fast fault simulation techniques for large combinational circuits, a panel discussion has been organized for the 1988 International Test Conference. This paper is a collective account of the position statements offered by the panelists
RELEASE: A High-level Paradigm for Reliable Large-scale Server Software
Erlang is a functional language with a much-emulated model for building reliable distributed systems. This paper outlines the RELEASE project, and describes the progress in the rst six months. The project aim is to scale the Erlang's radical concurrency-oriented programming paradigm to build reliable general-purpose software, such as server-based systems, on massively parallel machines. Currently Erlang has inherently scalable computation and reliability models, but in practice scalability is constrained by aspects of the language and virtual machine. We are working at three levels to address these challenges: evolving the Erlang virtual machine so that it can work effectively on large scale multicore systems; evolving the language to Scalable Distributed (SD) Erlang; developing a scalable Erlang infrastructure to integrate multiple, heterogeneous clusters. We are also developing state of the art tools that allow programmers to understand the behaviour of massively parallel SD Erlang programs. We will demonstrate the e ectiveness of the RELEASE approach using demonstrators and two large case studies on a Blue Gene
AN APPROACH FOR FAULT DETECTION AND FAULT MANAGEMENT IN THE WIRELESS SENSOR NETWORK TO EXTEND NETWORK LIFETIME
A mobile wireless ad hoc sensor network (MANET) consists of a group of homogeneous or heterogeneous mobile communicating hosts that form an arbitrary network interconnected via by means of several wireless communication media without any fixed infrastructure. In such network the delivery of the data packet from source to destination may fail for various reasons and major due to failure-prone environment of networks. This may happens due to the topology changes, node failure due to battery exhaust, failure of the communication module in the wireless node and results in the link failure. This paper addressed the major problem of link failure in the WSN and with the aim of providing robust solution so as to satisfy the stern end-to-end requirements of QoS-based communication networks. In this paper we modifies existing fully distributed cluster-based routing algorithm by addressing local recovery for the link failure. Performance of this new fault-tolerant fully distributed cluster-based routing algorithm is evaluated by simulating it in NS2 environment and we show that it performs better than the existing algorithm and provide better solution for fault detection and fault management along the QoS paths
AN APPROACH FOR FAULT DETECTION AND FAULT MANAGEMENT IN THE WIRELESS SENSOR NETWORK TO EXTEND NETWORK LIFETIME
A mobile wireless ad hoc sensor network (MANET) consists of a group of homogeneous or heterogeneous mobile communicating hosts that form an arbitrary network interconnected via by means of several wireless communication media without any fixed infrastructure. In such network the delivery of the data packet from source to destination may fail for various reasons and major due to failure-prone environment of networks. This may happens due to the topology changes, node failure due to battery exhaust, failure of the communication module in the wireless node and results in the link failure. This paper addressed the major problem of link failure in the WSN and with the aim of providing robust solution so as to satisfy the stern end-to-end requirements of QoS-based communication networks. In this paper we modifies existing fully distributed cluster-based routing algorithm by addressing local recovery for the link failure. Performance of this new fault-tolerant fully distributed cluster-based routing algorithm is evaluated by simulating it in NS2 environment and we show that it performs better than the existing algorithm and provide better solution for fault detection and fault management along the QoS paths
Optimized Surface Code Communication in Superconducting Quantum Computers
Quantum computing (QC) is at the cusp of a revolution. Machines with 100
quantum bits (qubits) are anticipated to be operational by 2020
[googlemachine,gambetta2015building], and several-hundred-qubit machines are
around the corner. Machines of this scale have the capacity to demonstrate
quantum supremacy, the tipping point where QC is faster than the fastest
classical alternative for a particular problem. Because error correction
techniques will be central to QC and will be the most expensive component of
quantum computation, choosing the lowest-overhead error correction scheme is
critical to overall QC success. This paper evaluates two established quantum
error correction codes---planar and double-defect surface codes---using a set
of compilation, scheduling and network simulation tools. In considering
scalable methods for optimizing both codes, we do so in the context of a full
microarchitectural and compiler analysis. Contrary to previous predictions, we
find that the simpler planar codes are sometimes more favorable for
implementation on superconducting quantum computers, especially under
conditions of high communication congestion.Comment: 14 pages, 9 figures, The 50th Annual IEEE/ACM International Symposium
on Microarchitectur
- …