Sciweavers

264 search results - page 44 / 53
» Bounding the number of tolerable faults in majority-based sy...
Sort
View
OPODIS
2008
14 years 10 months ago
Byzantine Consensus with Unknown Participants
Abstract. Consensus is a fundamental building block used to solve many practical problems that appear on reliable distributed systems. In spite of the fact that consensus is being ...
Eduardo Adílio Pelinson Alchieri, Alysson N...
ICFEM
2009
Springer
14 years 7 months ago
Graded-CTL: Satisfiability and Symbolic Model Checking
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
Alessandro Ferrante, Margherita Napoli, Mimmo Pare...
INFOCOM
2009
IEEE
15 years 4 months ago
MARA: Maximum Alternative Routing Algorithm
—In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constr...
Yasuhiro Ohara, Shinji Imahori, Rodney Van Meter
MICRO
2006
IEEE
159views Hardware» more  MICRO 2006»
14 years 9 months ago
MRF Reinforcer: A Probabilistic Element for Space Redundancy in Nanoscale Circuits
Shrinking devices to the nanoscale, increasing integration densities, and reducing of voltage levels down to the thermal limit, all conspire to produce faulty systems. Frequent oc...
Kundan Nepal, R. Iris Bahar, Joseph L. Mundy, Will...
IPPS
2006
IEEE
15 years 3 months ago
A self-stabilizing minimal dominating set algorithm with safe convergence
A self-stabilizing distributed system is a faulttolerant distributed system that tolerates any kind and any finite number of transient faults, such as message loss and memory cor...
Hirotsugu Kakugawa, Toshimitsu Masuzawa