Sciweavers

947 search results - page 118 / 190
» Fault Tolerant Computation on Ensemble Quantum Computers
Sort
View
ICDCS
2010
IEEE
15 years 10 months ago
Practical Robust Communication in DHTs Tolerating a Byzantine Adversary
—There are several analytical results on distributed hash tables (DHTs) that can tolerate Byzantine faults. Unfortunately, in such systems, operations such as data retrieval and ...
Maxwell Young, Aniket Kate, Ian Goldberg, Martin K...
ICTAC
2005
Springer
15 years 11 months ago
Revisiting Failure Detection and Consensus in Omission Failure Environments
It has recently been shown that fair exchange, a security problem in distributed systems, can be reduced to a fault tolerance problem, namely a special form of distributed consensu...
Carole Delporte-Gallet, Hugues Fauconnier, Felix C...
HPDC
2000
IEEE
15 years 10 months ago
Robust Resource Management for Metacomputers
In this paper we present a robust software infrastructure for metacomputing. The system is intended to be used by others as a building block for large and powerful computational g...
Jörn Gehring, Achim Streit
FOCS
1993
IEEE
15 years 10 months ago
A Tight Lower Bound for k-Set Agreement
: Weprove tight bounds on the time needed to solve k-set agreement, a natural generalization of consensus. We analyze this problem in a synchronous, message-passing model where pro...
Soma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, M...
NCA
2008
IEEE
16 years 17 days ago
Failure, Disconnection and Partition Detection in Mobile Environment
In mobile environment, nodes can move around and voluntarily leave or join the network. Furthermore, they can crash or be disconnected from the network due to the absence of netwo...
Denis Conan, Pierre Sens, Luciana Arantes, Mathieu...