Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleMay 2017
Security of Cyber-Physical Systems in the Presence of Transient Sensor Faults
ACM Transactions on Cyber-Physical Systems (TCPS), Volume 1, Issue 3Article No.: 15, Pages 1–23https://doi.org/10.1145/3064809This article is concerned with the security of modern Cyber-Physical Systems in the presence of transient sensor faults. We consider a system with multiple sensors measuring the same physical variable, where each sensor provides an interval with all ...
- research-articleFebruary 2016
Attack-Resilient Sensor Fusion for Safety-Critical Cyber-Physical Systems
ACM Transactions on Embedded Computing Systems (TECS), Volume 15, Issue 1Article No.: 21, Pages 1–24https://doi.org/10.1145/2847418This article focuses on the design of safe and attack-resilient Cyber-Physical Systems (CPS) equipped with multiple sensors measuring the same physical variable. A malicious attacker may be able to disrupt system performance through compromising a ...
- ArticleNovember 2014
CloudBFT: Elastic Byzantine Fault Tolerance
PRDC '14: Proceedings of the 2014 IEEE 20th Pacific Rim International Symposium on Dependable ComputingPages 180–189https://doi.org/10.1109/PRDC.2014.31Cloud computing is increasingly important, with the industry moving towards outsourcing computational resources as a means to reduce investment and management costs, while improving security, dependability and performance. Cloud operators use multi-...
- ArticleSeptember 2014
An Efficient Intermediate Data Fault-Tolerance Approach in the Cloud
WISA '14: Proceedings of the 2014 11th Web Information System and Application ConferencePages 203–206https://doi.org/10.1109/WISA.2014.44Recently, cloud computing frameworks have gained popularity for processing large scale parallel data applications. They usually generate enormous amounts of intermediate data which are short-lived, yet are important for the completion of job. Once there ...
- research-articleApril 2014
Resilient multidimensional sensor fusion using measurement history
HiCoNS '14: Proceedings of the 3rd international conference on High confidence networked systemsPages 1–10https://doi.org/10.1145/2566468.2566475This work considers the problem of performing resilient sensor fusion using past sensor measurements. In particular, we consider a system with n sensors measuring the same physical variable where some sensors might be attacked or faulty. We consider a ...
- research-articleJanuary 2012
The Weakest Failure Detectors to Solve Quittable Consensus and Nonblocking Atomic Commit
SIAM Journal on Computing (SICOMP), Volume 41, Issue 6Pages 1343–1379https://doi.org/10.1137/070698877We define quittable consensus, a natural variation of the consensus problem, where processes have the option to agree on “quit” if failures occur, and we relate this problem to the well-known problem of nonblocking atomic commit. We then determine the ...
- articleNovember 2007
Recovery Patterns for Iterative Methods in a Parallel Unstable Environment
SIAM Journal on Scientific Computing (SISC), Volume 30, Issue 1Pages 102–116https://doi.org/10.1137/040620394Several recovery techniques for parallel iterative methods are presented. First, the implementation of checkpoints in parallel iterative methods is described and analyzed. Then a simple checkpoint-free fault-tolerant scheme for parallel iterative ...
- ArticleJune 1997
Fault-Injection-Based Testing Of Fault-Tolerant Algorithms In Message-Passing Parallel Computers
FTCS '97: Proceedings of the 27th International Symposium on Fault-Tolerant Computing (FTCS '97)Page 258Distributed-memory parallel computers offer inherent redundancy that can be exploited to provide software-implemented fault tolerance. Numerous algorithms have been developed for fault-tolerant unicast communication, fault-tolerant broadcast, fault ...
- research-articleFebruary 1997
A General Method for Maximizing the Error-Detecting Ability of Distributed Algorithms
IEEE Transactions on Parallel and Distributed Systems (TPDS), Volume 8, Issue 2Pages 164–172https://doi.org/10.1109/71.577258The bound on component failures and their spatial distribution govern the fault tolerance of any candidate error-detecting algorithm. For distributed memory multiprocessors, the specific algorithm and the topology of the processor interconnection ...
- ArticleOctober 1994
Optimal fault-tolerant communication algorithms on product networks using spanning trees
SPDP '94: Proceedings of the 1994 6th IEEE Symposium on Parallel and Distributed ProcessingPages 188–195https://doi.org/10.1109/SPDP.1994.346167Over the last years cartesian product graphs have started to receive increasing attention as general class of networks for multiprocessor systems. One reason is that many efficient and popular networks such as the meshes, tori, hypercubes, hyper de ...
- research-articleJuly 1994
Fault-Tolerant Algorithms for Fair Interprocess Synchronization
IEEE Transactions on Parallel and Distributed Systems (TPDS), Volume 5, Issue 7Pages 737–748https://doi.org/10.1109/71.296319The implementation of nondeterministic pairwise synchronous communication among a set of asynchronous processes is modeled as the binary interaction problem. The paperdescribes an algorithm for this problem that satisfies a strong fairness property ...
- research-articleDecember 1993
A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems (TPDS), Volume 4, Issue 12Pages 1320–1331https://doi.org/10.1109/71.250114The theoretical background for the design of deadlock-free adaptive routing algorithmsfor wormhole networks is developed. The author proposes some basic definitions and twotheorems. These create the conditions to verify that an adaptive algorithm ...
- ArticleApril 1993
Global semigroup operations in faulty SIMD hypercubes
IPPS '93: Proceedings of the 1993 Seventh International Parallel Processing SymposiumPages 706–711https://doi.org/10.1109/IPPS.1993.262794The authors consider the problem of computing a global semigroup operation (such as addition and multiplication) on a faulty hypercube. In particular, they study the problem of performing such an operation in an n-dimensional SIMD hypercube Q/sub n/, ...