61 search results - page 1 / 13 » An empirical study of a scalable Byzantine agreement algorit... |
IPPS
2010
IEEE
13 years 2 months ago
2010
IEEE
ICDCN
2011
Springer
12 years 8 months ago
2011
Springer
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 ...
PODC
2012
ACM
11 years 7 months ago
2012
ACM
In recent years, there have been a few proposals to add a small amount of trusted hardware at each replica in a Byzantine fault tolerant system to cut back replication factors. Th...
RTSS
2008
IEEE
13 years 11 months ago
2008
IEEE
Multicore platforms are predicted to become significantly larger in the coming years. Given that real-time workloads will inevitably be deployed on such platforms, the scalabilit...
TSE
2010
12 years 11 months ago
2010
Genetic algorithms (GAs) have been applied previously to UML-driven, stress test requirements generation with the aim of increasing chances of discovering faults relating to networ...