Sciweavers

1101 search results - page 21 / 221
» Fault-Tolerance in Distributed Query Processing
Sort
View
EUROSYS
2011
ACM
14 years 1 months ago
Increasing performance in byzantine fault-tolerant systems with on-demand replica consistency
Traditional agreement-based Byzantine fault-tolerant (BFT) systems process all requests on all replicas to ensure consistency. In addition to the overhead for BFT protocol and sta...
Tobias Distler, Rüdiger Kapitza
ICDCS
2012
IEEE
13 years 14 hour ago
Combining Partial Redundancy and Checkpointing for HPC
Today’s largest High Performance Computing (HPC) systems exceed one Petaflops (1015 floating point operations per second) and exascale systems are projected within seven years...
James Elliott, Kishor Kharbas, David Fiala, Frank ...
JAVA
2001
Springer
15 years 2 months ago
A scalable, robust network for parallel computing
CX, a network-based computational exchange, is presented. The system’s design integrates variations of ideas from other researchers, such as work stealing, non-blocking tasks, e...
Peter R. Cappello, Dimitros Mourloukos
ADAEUROPE
2001
Springer
15 years 2 months ago
Building Modern Distributed Systems
Abstract. Ada 95 has been the first standardized language to include distribution in the core language itself. However, the set of features required by the Distributed Systems Ann...
Laurent Pautet, Thomas Quinot, Samuel Tardieu
JSS
1998
90views more  JSS 1998»
14 years 9 months ago
A taxonomy of distributed termination detection algorithms
An important problem in the ®eld of distributed systems is that of detecting the termination of a distributed computation. Distributed termination detection (DTD) is a dicult p...
Jeff Matocha, Tracy Camp