CUDA accelerated fault tree analysis with C-XSC

Authors:
Gabor Rebner;Michael Beer
Affiliations:
Computer and Cognitive Science, University of Duisburg-Essen, Duisburg, Germany;Institute for Risk & Uncertainty, University of Liverpool, Liverpool, UK
Venue:
SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management
Year:
2012

Citing 3
Cited 0

What every computer scientist should know about floating-point arithmetic

ACM Computing Surveys (CSUR)
Using C-XSC for high performance verified computing

PARA'10 Proceedings of the 10th international conference on Applied Parallel and Scientific Computing - Volume 2
A verified realization of a Dempster–Shafer based fault tree analysis

Computing - Special Issue on GAMM-IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics (SCAN2010)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Fault tree analysis is a widespread mathematical method for determining the failure probability of observed real-life systems. In addition to failure probability defined by wear, the system model has to take into account intrinsic and extrinsic system influences. To make allowance for such factors, we draw on an implementation by Rebner et al. to compute the lower and upper bounds of the failure probability of the top event based on interval analysis implemented in MATLAB using INTLAB. We present a new verified implementation in C++ to reduce the trade-off between accuracy and computation time, describe the new implementation by giving an illustrative example based on work by Luther et al. and show the advantages of our new implementation.