Sciweavers

1254 search results - page 194 / 251
» Making Hard Problems Harder
Sort
View
SOSP
2003
ACM
14 years 5 months ago
Samsara: honor among thieves in peer-to-peer storage
Peer-to-peer storage systems assume that their users consume resources in proportion to their contribution. Unfortunately, users are unlikely to do this without some enforcement m...
Landon P. Cox, Brian D. Noble
ASPLOS
2010
ACM
14 years 3 months ago
SherLog: error diagnosis by connecting clues from run-time logs
Computer systems often fail due to many factors such as software bugs or administrator errors. Diagnosing such production run failures is an important but challenging task since i...
Ding Yuan, Haohui Mai, Weiwei Xiong, Lin Tan, Yuan...
SAC
2010
ACM
14 years 3 months ago
Asynchronous Byzantine consensus with 2f+1 processes
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
Miguel Correia, Giuliana Santos Veronese, Lau Cheu...
CCS
2009
ACM
14 years 3 months ago
NISAN: network information service for anonymization networks
Network information distribution is a fundamental service for any anonymization network. Even though anonymization and information distribution about the network are two orthogona...
Andriy Panchenko, Stefan Richter, Arne Rache
CCS
2009
ACM
14 years 3 months ago
Keep your friends close: the necessity for updating an anomaly sensor with legitimate environment changes
Large-scale distributed systems have dense, complex code-bases that are assumed to perform multiple and inter-dependent tasks while user interaction is present. The way users inte...
Angelos Stavrou, Gabriela F. Cretu-Ciocarlie, Mich...