Sciweavers

184 search results - page 2 / 37
» Communication in Networks with Random Dependent Faults
Sort
View
RANDOM
1998
Springer
13 years 11 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
ISPAN
1999
IEEE
13 years 11 months ago
Sparse Networks Tolerating Random Faults
A network G is called random-fault-tolerant (RFT) network for a network G if G contains a fault-free isomorphic copy of G with high probability even if each processor fails indepe...
Toshinori Yamada, Shuichi Ueno
ISVLSI
2003
IEEE
118views VLSI» more  ISVLSI 2003»
14 years 19 days ago
Networks-On-Chip: The Quest for On-Chip Fault-Tolerant Communication
In this paper, we discuss the possibility of achieving onchip fault-tolerant communication based on a new communication paradigm called stochastic communication. Specifically, for...
Radu Marculescu
IPPS
1999
IEEE
13 years 11 months ago
Dependability Evaluation of Fault Tolerant Distributed Industrial Control Systems
Modern distributed industrial control systems need improvements in their dependability. In this paper we study the dependability of a fault tolerant distributed industrial control ...
José Carlos Campelo, Pedro Yuste, Francisco...
SAC
2008
ACM
13 years 6 months ago
Providing dependability for web services
Web services have been widely employed to allow interoperability among applications and/or technologies. However, the standard technologies and protocols which provide the foundat...
Jeferson L. R. Souza, Frank Siqueira