-
1
-
-
10444221253
-
Reconstructing paxos
-
R. Boichat, P. Dutta, S. Frolund, and R. Guerraoui, "Reconstructing Paxos," SIGACT News, vol. 34, no. 2, pp. 42-57, 2003.
-
(2003)
SIGACT News
, vol.34
, Issue.2
, pp. 42-57
-
-
Boichat, R.1
Dutta, P.2
Frolund, S.3
Guerraoui, R.4
-
3
-
-
0345757358
-
Practical Byzantine fault tolerance and proactive recovery
-
M. Castro and B. Liskov, "Practical Byzantine Fault Tolerance and Proactive Recovery," ACM Trans. Computer Systems, vol. 20, no. 4, pp. 398-461, 2002.
-
(2002)
ACM Trans. Computer Systems
, vol.20
, Issue.4
, pp. 398-461
-
-
Castro, M.1
Liskov, B.2
-
4
-
-
27544499731
-
Best-case complexity of asynchronous Byzantine consensus
-
École Polytechnique Fédérale de Lausanne, Feb.
-
P. Dutta, R. Guerraoui, and M. Vukolić, "Best-Case Complexity of Asynchronous Byzantine Consensus," Technical Report EPFL/IC/200499, École Polytechnique Fédérale de Lausanne, Feb. 2005.
-
(2005)
Technical Report
, vol.EPFL-IC-200499
-
-
Dutta, P.1
Guerraoui, R.2
Vukolić, M.3
-
5
-
-
0022045868
-
Impossibility of distributed consensus with one faulty process
-
M. Fischer, N. Lynch, and M. Paterson, "Impossibility of Distributed Consensus with One Faulty Process," J. ACM, vol. 32, no. 2, pp. 374-382, 1985.
-
(1985)
J. ACM
, vol.32
, Issue.2
, pp. 374-382
-
-
Fischer, M.1
Lynch, N.2
Paterson, M.3
-
6
-
-
19944414935
-
Simple and efficient oracle-based consensus protocols for asynchronous Byzantine systems
-
Jan.
-
R. Friedman, A. Mostefaoui, and M. Raynal, "Simple and Efficient Oracle-Based Consensus Protocols for Asynchronous Byzantine Systems," IEEE Trans. Dependable and Secure Computing, vol. 2, no. 1, pp. 46-56, Jan. 2005.
-
(2005)
IEEE Trans. Dependable and Secure Computing
, vol.2
, Issue.1
, pp. 46-56
-
-
Friedman, R.1
Mostefaoui, A.2
Raynal, M.3
-
7
-
-
0033312744
-
A simple and fast asynchronous consensus protocol based on a weak failure detector
-
Sept.
-
M. Hurfin and M. Raynal, "A Simple and Fast Asynchronous Consensus Protocol Based on a Weak Failure Detector," Distributed Computing, vol. 12, no. 4, pp. 209-223, Sept. 1999.
-
(1999)
Distributed Computing
, vol.12
, Issue.4
, pp. 209-223
-
-
Hurfin, M.1
Raynal, M.2
-
8
-
-
0003982874
-
On the cost of fault-tolerant consensus when there are no faults
-
Massachusetts Inst. of Technology
-
I. Keidar and S. Rajsbaum, "On the Cost of Fault-Tolerant Consensus when There Are No Faults," Technical Report MIT-LCS-TR-821, Massachusetts Inst. of Technology, 2001.
-
(2001)
Technical Report
, vol.MIT-LCS-TR-821
-
-
Keidar, I.1
Rajsbaum, S.2
-
9
-
-
0041347738
-
Using optimistic atomic broadcast in transaction processing systems
-
July/Aug.
-
B. Kemme, F. Pedone, G. Alonso, A. Schiper, and M. Wiesmann, "Using Optimistic Atomic Broadcast in Transaction Processing Systems," IEEE Trans. Knowledge and Data Eng., vol. 15, no. 4, pp. 1018-1032, July/Aug. 2003.
-
(2003)
IEEE Trans. Knowledge and Data Eng.
, vol.15
, Issue.4
, pp. 1018-1032
-
-
Kemme, B.1
Pedone, F.2
Alonso, G.3
Schiper, A.4
Wiesmann, M.5
-
11
-
-
0017996760
-
Time, clocks, and the ordering of events in a distributed system
-
July
-
L. Lamport, "Time, Clocks, and the Ordering of Events in a Distributed System," Comm. ACM, vol. 21, no. 7, pp. 558-565, July 1978.
-
(1978)
Comm. ACM
, vol.21
, Issue.7
, pp. 558-565
-
-
Lamport, L.1
-
12
-
-
0032058184
-
The part-time parliament
-
L. Lamport, "The Part-Time Parliament," ACM Trans. Computer Systems, vol. 16, no. 2, pp. 133-169, 1998.
-
(1998)
ACM Trans. Computer Systems
, vol.16
, Issue.2
, pp. 133-169
-
-
Lamport, L.1
-
14
-
-
33646533576
-
Lower bounds for asynchronous consensus
-
Microsoft Research, July
-
L. Lamport, "Lower Bounds for Asynchronous Consensus," Technical Report MSR-TR-2004-72, Microsoft Research, July 2004.
-
(2004)
Technical Report
, vol.MSR-TR-2004-72
-
-
Lamport, L.1
-
15
-
-
33748113231
-
Fast paxos
-
Microsoft Research
-
L. Lamport, "Fast Paxos," Technical Report MSR-TR-2005-112, Microsoft Research, 2005.
-
(2005)
Technical Report
, vol.MSR-TR-2005-112
-
-
Lamport, L.1
-
16
-
-
0003501560
-
Byzantine generals and transaction commit protocols
-
SRI Int'l
-
L. Lamport and M. Fischer, "Byzantine Generals and Transaction Commit Protocols," Technical Report 62, SRI Int'l, 1982.
-
(1982)
Technical Report
, vol.62
-
-
Lamport, L.1
Fischer, M.2
-
17
-
-
0032306029
-
Byzantine quorum systems
-
D. Malkhi and M. Reiter, "Byzantine Quorum Systems," Distributed Computing, vol. 11, no. 4, pp. 203-213, 1998.
-
(1998)
Distributed Computing
, vol.11
, Issue.4
, pp. 203-213
-
-
Malkhi, D.1
Reiter, M.2
-
18
-
-
27544438715
-
Fast Byzantine paxos
-
Department of Computer Sciences, Univ. of Texas at Austin, Feb.
-
J.-P. Martin and L. Alvisi, "Fast Byzantine Paxos," Technical Report TR-04-07, Department of Computer Sciences, Univ. of Texas at Austin, Feb. 2004.
-
(2004)
Technical Report
, vol.TR-04-07
-
-
Martin, J.-P.1
Alvisi, L.2
-
19
-
-
84947286466
-
Minimal Byzantine storage
-
Oct.
-
J.-P. Martin, L. Alvisi, and M. Dahlin, "Minimal Byzantine Storage," Proc. Sixth Int'l Conf. Distributed Computing (DISC), pp. 311-325, Oct. 2002.
-
(2002)
Proc. Sixth Int'l Conf. Distributed Computing (DISC)
, pp. 311-325
-
-
Martin, J.-P.1
Alvisi, L.2
Dahlin, M.3
-
20
-
-
0036036816
-
BASE: Using abstraction to improve fault tolerance
-
Oct.
-
R. Rodrigues, M. Castro, and B. Liskov, "BASE: Using Abstraction to Improve Fault Tolerance," Proc. 18th ACM Symp. Operating Systems Principles, pp. 15-28, Oct. 2001.
-
(2001)
Proc. 18th ACM Symp. Operating Systems Principles
, pp. 15-28
-
-
Rodrigues, R.1
Castro, M.2
Liskov, B.3
-
21
-
-
0031123554
-
Early consensus in an asynchronous system with a weak failure detector
-
Apr.
-
A. Schiper, "Early Consensus in an Asynchronous System with a Weak Failure Detector," Distributed Computing, vol. 10, no. 3, pp. 149-157, Apr. 1997.
-
(1997)
Distributed Computing
, vol.10
, Issue.3
, pp. 149-157
-
-
Schiper, A.1
-
22
-
-
0025564050
-
Implementing fault-tolerant services using the state machine approach: A tutorial
-
Sept.
-
F.B. Schneider, "Implementing Fault-Tolerant Services Using the State Machine Approach: A Tutorial," ACM Computing Surveys, vol. 22, no. 4, pp. 299-319, Sept. 1990.
-
(1990)
ACM Computing Surveys
, vol.22
, Issue.4
, pp. 299-319
-
-
Schneider, F.B.1
-
23
-
-
21644446595
-
Separating agreement from execution for Byzantine fault tolerant services
-
Oct.
-
J. Yin, J.-P. Martin, A. Venkataramani, L. Alvisi, and M. Dahlin, "Separating Agreement from Execution for Byzantine Fault Tolerant Services," Proc. 19th ACM Symp. Operating Systems Principles, pp. 253-267, Oct. 2003.
-
(2003)
Proc. 19th ACM Symp. Operating Systems Principles
, pp. 253-267
-
-
Yin, J.1
Martin, J.-P.2
Venkataramani, A.3
Alvisi, L.4
Dahlin, M.5
|