231 search results - page 33 / 47 » A Byzantine Fault Tolerant Distributed Commit Protocol |
154
click to vote
DAC
2011
ACM
14 years 3 months ago
2011
ACM
As transistor dimensions continue to scale deep into the nanometer regime, silicon reliability is becoming a chief concern. At the same time, transistor counts are scaling up, ena...
112
click to vote
IPL
2008
15 years 4 months ago
2008
Several recent research results describe how to design Distributed Hash Tables (DHTs) that are robust to adversarial attack via Byzantine faults. Unfortunately, all of these resul...
142
click to vote
SOSP
2007
ACM
16 years 27 days ago
2007
ACM
We propose a new paradigm for building scalable distributed systems. Our approach does not require dealing with message-passing protocols—a major complication in existing distri...
159
click to vote
ESORICS
2010
Springer
15 years 5 months ago
2010
Springer
Fair exchange is one of the most fundamental problems in secure distributed computation. Alice has something that Bob wants, and Bob has something that Alice wants. A fair exchang...
139
click to vote
ICDCS
2000
IEEE
15 years 8 months ago
2000
IEEE
To assure dependable onboard evolution, we have developed a methodology called guarded software upgrading (GSU). In this paper, we focus on a low-cost approach to error containmen...