Sciweavers

306 search results - page 6 / 62
» Fault-Tolerant Computation in the Full Information Model
Sort
View
SPAA
2003
ACM
14 years 29 days ago
The effect of communication costs in solid-state quantum computing architectures
Quantum computation has become an intriguing technology with which to attack difficult problems and to enhance system security. Quantum algorithms, however, have been analyzed un...
Dean Copsey, Mark Oskin, Tzvetan S. Metodi, Freder...
TCC
2010
Springer
208views Cryptology» more  TCC 2010»
14 years 4 months ago
Rationality in the Full-Information Model
We study rationality in protocol design for the full-information model, a model characterized by computationally unbounded adversaries, no private communication, and no simultanei...
Ronen Gradwohl
HPCC
2010
Springer
13 years 8 months ago
A Generic Execution Management Framework for Scientific Applications
Managing the execution of scientific applications in a heterogeneous grid computing environment can be a daunting task, particularly for long running jobs. Increasing fault tolera...
Tanvire Elahi, Cameron Kiddle, Rob Simmonds
HPDC
2006
IEEE
14 years 1 months ago
XtremLab: A System for Characterizing Internet Desktop Grids
Desktop grid (DG) systems use the idle computing power of many volunteered desktop PC’s on the Internet to support large-scale computation and storage. For over a decade, DG sys...
Paul Malecot, Derrick Kondo, Gilles Fedak
ICDCN
2011
Springer
12 years 11 months ago
Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
Valerie King, Steven Lonargan, Jared Saia, Amitabh...