Sciweavers

34 search results - page 3 / 7
» New Limits on Fault-Tolerant Quantum Computation
Sort
View
IPPS
2005
IEEE
14 years 1 months ago
Extended Golomb Rulers as the New Recovery Schemes in Distributed Dependable Computing
Clusters and distributed systems offer fault tolerance and high performance through load sharing. When all computers are up and running, we would like the load to be evenly distri...
Kamilla Klonowska, Lars Lundberg, Håkan Lenn...
CCGRID
2001
IEEE
13 years 11 months ago
Sabotage-Tolerance Mechanisms for Volunteer Computing Systems
In this paper, we address the new problem of protecting volunteer computing systems from malicious volunteers who submit erroneous results by presenting sabotagetolerance mechanis...
Luis F. G. Sarmenta
ASPDAC
2005
ACM
80views Hardware» more  ASPDAC 2005»
13 years 9 months ago
Synthesis of quantum logic circuits
— The pressure of fundamental limits on classical computation and the promise of exponential speedups from quantum effects have recently brought quantum circuits to the attention...
Vivek V. Shende, Stephen S. Bullock, Igor L. Marko...
ICALP
2005
Springer
14 years 1 months ago
All Quantum Adversary Methods Are Equivalent
Abstract: The quantum adversary method is one of the most versatile lower-bound methods for quantum algorithms. We show that all known variants of this method are equivalent: spect...
Robert Spalek, Mario Szegedy
IPPS
2007
IEEE
14 years 1 months ago
RI2N/UDP: High bandwidth and fault-tolerant network for a PC-cluster based on multi-link Ethernet
PC-clusters with high performance/cost ratio have been one of the typical platforms for high performance computing. To lower costs, Gigabit Ethernet is often used for intercommuni...
Takayuki Okamoto, Shin'ichi Miura, Taisuke Boku, M...