101,030 research outputs found
Performance modeling of fault-tolerant circuit-switched communication networks
Circuit switching (CS) has been suggested as an efficient switching method for supporting simultaneous communications (such as data, voice, and images) across parallel systems due to its ability to preserve both communication performance and fault-tolerant demands in such systems. In this paper we present an efficient scheme to capture the mean message latency in 2D torus with CS in the presence of faulty components. We have also conducted extensive simulation experiments, the results of which are used to validate the analytical mode
Parallel, Asynchronous Executive (PAX): System concepts, facilities, and architecture
The Parallel, Asynchronous Executive (PAX) is a software operating system simulation that allows many computers to work on a single problem at the same time. PAX is currently implemented on a UNIVAC 1100/42 computer system. Independent UNIVAC runstreams are used to simulate independent computers. Data are shared among independent UNIVAC runstreams through shared mass-storage files. PAX has achieved the following: (1) applied several computing processes simultaneously to a single, logically unified problem; (2) resolved most parallel processor conflicts by careful work assignment; (3) resolved by means of worker requests to PAX all conflicts not resolved by work assignment; (4) provided fault isolation and recovery mechanisms to meet the problems of an actual parallel, asynchronous processing machine. Additionally, one real-life problem has been constructed for the PAX environment. This is CASPER, a collection of aerodynamic and structural dynamic problem simulation routines. CASPER is not discussed in this report except to provide examples of parallel-processing techniques
Recommended from our members
Simulation of subseismic joint and fault networks using a heuristic mechanical model
Flow simulations of fractured and faulted reservoirs require representation of subseismic structures about which subsurface data are limited. We describe a method for simulating fracture growth that is mechanically based but heuristic, allowing for realistic modelling of fracture networks with reasonable run times. The method takes a triangulated meshed surface as input, together with an initial stress field. Fractures initiate and grow based on the stress field, and the growing fractures relieve the stress in the mesh. We show that a wide range of bedding-plane joint networks can be modelled simply by varying the distribution and anisotropy of the initial stress field. The results are in good qualitative agreement with natural joint patterns. We then apply the method to a set of parallel veins and demonstrate how the variations in thickness of the veins can be represented. Lastly, we apply the method to the simulation of normal fault patterns on salt domes. We derive the stress field on the bedding surface using the horizon curvature. The modelled fault network shows both radial and concentric faults. The new method provides an effective means of modelling joint and fault networks that can be imported to the flow simulator
FPGA Based Design for Accelerated Fault-testing of Integrated Circuits
In the past few decades, integrated circuits have become a major part of everyday life. Every circuit that is created needs to be tested for faults so faulty circuits are not sent to end-users. The creation of these tests is time consuming, costly and difficult to perform on larger circuits. This research presents a novel method for fault detection and test pattern reduction in integrated circuitry under test. By leveraging the FPGA\u27s reconfigurability and parallel processing capabilities, a speed up in fault detection can be achieved over previous computer simulation techniques. This work presents the following contributions to the field of Stuck-At-Fault detection: We present a new method for inserting faults into a circuit net list. Given any circuit netlist, our tool can insert multiplexers into a circuit at correct internal nodes to aid in fault emulation on reconfigurable hardware. We present a parallel method of fault emulation. The benefit of the FPGA is not only its ability to implement any circuit, but its ability to process data in parallel. This research utilizes this to create a more efficient emulation method that implements numerous copies of the same circuit in the FPGA. A new method to organize the most efficient faults. Most methods for determinin the minimum number of inputs to cover the most faults require sophisticated softwareprograms that use heuristics. By utilizing hardware, this research is able to process data faster and use a simpler method for an efficient way of minimizing inputs
Simulating spatial and temporal evolution of multiple wing cracks around faults in crystalline basement rocks
Fault zones are structurally highly spatially heterogeneous and hence extremely complex. Observations of fluid flow through fault zones over several scales show that this structural complexity is reflected in the hydrogeological properties of faults. Information on faults at depth is scarce, hence, it is highly valuable to understand the controls on spatial and temporal fault zone development. In this paper we increase our understanding of fault damage zone development in crystalline rocks by dynamically simulating the growth of single and multiple splay fractures produced from failure on a pre-existing fault. We present a new simulation model, MOPEDZ (Modeling Of Permeability Evolution in the Damage Zone surrounding faults), that simulates fault evolution through solution of Navier's equation with a combined Mohr-Coulomb and tensile failure criteria. Simulations suggest that location, frequency, mode of failure and orientation of splay fractures are significantly affected both by the orientation of the fault with respect to the maximum principal compressive stress and the conditions of differential stress. Model predictions compare well with published field outcrop data, confirming that this model produces realistic damage zone geometries
Simulating chemistry efficiently on fault-tolerant quantum computers
Quantum computers can in principle simulate quantum physics exponentially
faster than their classical counterparts, but some technical hurdles remain.
Here we consider methods to make proposed chemical simulation algorithms
computationally fast on fault-tolerant quantum computers in the circuit model.
Fault tolerance constrains the choice of available gates, so that arbitrary
gates required for a simulation algorithm must be constructed from sequences of
fundamental operations. We examine techniques for constructing arbitrary gates
which perform substantially faster than circuits based on the conventional
Solovay-Kitaev algorithm [C.M. Dawson and M.A. Nielsen, \emph{Quantum Inf.
Comput.}, \textbf{6}:81, 2006]. For a given approximation error ,
arbitrary single-qubit gates can be produced fault-tolerantly and using a
limited set of gates in time which is or ; with sufficient parallel preparation of ancillas, constant average
depth is possible using a method we call programmable ancilla rotations.
Moreover, we construct and analyze efficient implementations of first- and
second-quantized simulation algorithms using the fault-tolerant arbitrary gates
and other techniques, such as implementing various subroutines in constant
time. A specific example we analyze is the ground-state energy calculation for
Lithium hydride.Comment: 33 pages, 18 figure
Fault-Tolerant Adaptive Parallel and Distributed Simulation
Discrete Event Simulation is a widely used technique that is used to model
and analyze complex systems in many fields of science and engineering. The
increasingly large size of simulation models poses a serious computational
challenge, since the time needed to run a simulation can be prohibitively
large. For this reason, Parallel and Distributes Simulation techniques have
been proposed to take advantage of multiple execution units which are found in
multicore processors, cluster of workstations or HPC systems. The current
generation of HPC systems includes hundreds of thousands of computing nodes and
a vast amount of ancillary components. Despite improvements in manufacturing
processes, failures of some components are frequent, and the situation will get
worse as larger systems are built. In this paper we describe FT-GAIA, a
software-based fault-tolerant extension of the GAIA/ART\`IS parallel simulation
middleware. FT-GAIA transparently replicates simulation entities and
distributes them on multiple execution nodes. This allows the simulation to
tolerate crash-failures of computing nodes; furthermore, FT-GAIA offers some
protection against byzantine failures since synchronization messages are
replicated as well, so that the receiving entity can identify and discard
corrupted messages. We provide an experimental evaluation of FT-GAIA on a
running prototype. Results show that a high degree of fault tolerance can be
achieved, at the cost of a moderate increase in the computational load of the
execution units.Comment: Proceedings of the IEEE/ACM International Symposium on Distributed
Simulation and Real Time Applications (DS-RT 2016
- …