Sciweavers

83 search results - page 5 / 17
» Implementing Trustworthy Services Using Replicated State Mac...
Sort
View
IPPS
2006
IEEE
15 years 3 months ago
Wire-speed total order
— Many distributed systems may be limited in their performance by the number of transactions they are able to support per unit of time. In order to achieve fault tolerance and to...
Tal Anker, Danny Dolev, G. Greenman, I. Shnaiderma...
NCA
2007
IEEE
15 years 3 months ago
Decoupled Quorum-Based Byzantine-Resilient Coordination in Open Distributed Systems
Open distributed systems are typically composed by an unknown number of processes running in heterogeneous hosts. Their communication often requires tolerance to temporary disconn...
Alysson Neves Bessani, Miguel Correia, Joni da Sil...
77
Voted
LADC
2005
Springer
15 years 3 months ago
Group-Based Replication of On-Line Transaction Processing Servers
Several techniques for database replication using group communication have recently been proposed, namely, the Database State Machine, PostgresR, and the NODO protocol. Although a...
Alfrânio Correia Jr., A. Sousa, L. Soares, J...
WWW
2004
ACM
15 years 2 months ago
Flexible on-device service object replication with replets
An increasingly large amount of such applications employ service objects such as Servlets to generate dynamic and personalized content. Existing caching infrastructures are not we...
Dong Zhou, Nayeem Islam, Ali Ismael
91
Voted
NSDI
2010
14 years 11 months ago
Prophecy: Using History for High-Throughput Fault Tolerance
Byzantine fault-tolerant (BFT) replication has enjoyed a series of performance improvements, but remains costly due to its replicated work. We eliminate this cost for read-mostly ...
Siddhartha Sen, Wyatt Lloyd, Michael J. Freedman