-
1
-
-
84957037561
-
Stable leader election
-
J. L. Welch, Ed. Lecture Notes in Computer Science, Springer-Verlag, Berlin, Germany
-
AGUILERA, M. K., DELPORTE-GALLET, C., FAUCONNIER, H., AND TOUEG, S. 2001. Stable leader election. In DISC '01: Proceedings of the 15th International Conference on Distributed Computing, J. L. Welch, Ed. Lecture Notes in Computer Science, vol. 2180. Springer-Verlag, Berlin, Germany, 108-122.
-
(2001)
DISC '01: Proceedings of the 15th International Conference on Distributed Computing
, vol.2180
, pp. 108-122
-
-
Aguilera, M.K.1
Delporte-Gallet, C.2
Fauconnier, H.3
Toueg, S.4
-
3
-
-
0003567016
-
-
Addison-Wesley, Reading, MA
-
BERNSTEIN, P. A., HADZILACOS, V., AND GOODMAN, N. 1987. Concurrency Control and Recovery in Database Systems. Addison-Wesley, Reading, MA.
-
(1987)
Concurrency Control and Recovery in Database Systems
-
-
Bernstein, P.A.1
Hadzilacos, V.2
Goodman, N.3
-
4
-
-
0019705854
-
Transaction monitoring in encompass: Reliable distributed transaction processing
-
(Ann Arbor, MI, April 29-May 1), Y. E. Lien, Ed. ACM Press, New York, NY
-
BORR, A. J. 1981. Transaction monitoring in encompass: Reliable distributed transaction processing. In Proceedings of the 1981 ACM SIGMOD International Conference on Management of Data (Ann Arbor, MI, April 29-May 1), Y. E. Lien, Ed. ACM Press, New York, NY, 155-165.
-
(1981)
Proceedings of the 1981 ACM SIGMOD International Conference on Management of Data
, pp. 155-165
-
-
Borr, A.J.1
-
5
-
-
0003426516
-
Uniform consensus is harder than consensus (extended abstract)
-
École Polytechnique Fédérale de Lausanne, Switzerland
-
CHARRON-BOST, B. AND SCHIPER, A. 2000. Uniform consensus is harder than consensus (extended abstract). Tech. rep. DSC/2000/028. École Polytechnique Fédérale de Lausanne, Switzerland.
-
(2000)
Tech. Rep.
, vol.DSC-2000-028
-
-
Charron-Bost, B.1
Schiper, A.2
-
6
-
-
84949216703
-
Revisiting the Paxos algorithm
-
M. Mavronicolas and P. Tsigas, Eds. Lecture Notes in Computer Science, Springer-Verlag, Saarbruken, Germany
-
DE PRISCO, R., LAMPSON, B., AND LYNCH, N. 1997. Revisiting the Paxos algorithm. In Proceedings of the 11th International Workshop on Distributed Algorithms (WDAG 97), M. Mavronicolas and P. Tsigas, Eds. Lecture Notes in Computer Science, vol. 1320. Springer-Verlag, Saarbruken, Germany, 111-125.
-
(1997)
Proceedings of the 11th International Workshop on Distributed Algorithms (WDAG 97)
, vol.1320
, pp. 111-125
-
-
De Prisco, R.1
Lampson, B.2
Lynch, N.3
-
7
-
-
0023994903
-
Consensus in the presence of partial synchrony
-
DWORK, C., LYNCH, N., AND STOCKMEYER, L. 1988. Consensus in the presence of partial synchrony. J. Assoc. Comput. Mach. 35, 2 (Apr.), 288-323.
-
(1988)
J. Assoc. Comput. Mach.
, vol.35
, Issue.2 APR
, pp. 288-323
-
-
Dwork, C.1
Lynch, N.2
Stockmeyer, L.3
-
8
-
-
0022045868
-
Impossibility of distributed consensus with one faulty process
-
FISCHER, M. J., LYNCH, N., AND PATERSON, M. S. 1985. Impossibility of distributed consensus with one faulty process. J. Assoc. Comput. Mach. 32, 2 (Apr.), 374-382.
-
(1985)
J. Assoc. Comput. Mach.
, vol.32
, Issue.2 APR
, pp. 374-382
-
-
Fischer, M.J.1
Lynch, N.2
Paterson, M.S.3
-
9
-
-
85027830059
-
Notes on data base operating systems
-
R. Bayer, R. M. Graham, and G. Seegmuller, Eds. Lecture Notes in Computer Science, Springer-Verlag, Berlin, Heidelberg, Germany/New York, NY
-
GRAY, J. 1978. Notes on data base operating systems. In Operating Systems: An Advanced Course, R. Bayer, R. M. Graham, and G. Seegmuller, Eds. Lecture Notes in Computer Science, vol. 60. Springer-Verlag, Berlin, Heidelberg, Germany/New York, NY, 393-481.
-
(1978)
Operating Systems: An Advanced Course
, vol.60
, pp. 393-481
-
-
Gray, J.1
-
10
-
-
84947902519
-
Revisiting the relationship between nonblocking atomic commitment and consensus
-
J.-M. Hélary and M. Raynal, Eds. Lecture Notes in Computer Science, Springer-Verlag, Le Mont-Saint-Michel, France
-
GUERRAOUI, R. 1995. Revisiting the relationship between nonblocking atomic commitment and consensus. In Proceedings of the 9th International Workshop on Distributed Algorithms (WDAG95), J.-M. Hélary and M. Raynal, Eds. Lecture Notes in Computer Science, vol. 972. Springer-Verlag, Le Mont-Saint-Michel, France, 87-100.
-
(1995)
Proceedings of the 9th International Workshop on Distributed Algorithms (WDAG95)
, vol.972
, pp. 87-100
-
-
Guerraoui, R.1
-
11
-
-
0029713014
-
Reducing the cost for nonblocking in atomic commitment
-
IEEE Computer Society Press, Los Alamitos, CA
-
GUERRAOUI, R., LARREA, M., AND SCHIPER, A. 1996. Reducing the cost for nonblocking in atomic commitment. In Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS). IEEE Computer Society Press, Los Alamitos, CA, 692-697.
-
(1996)
Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS)
, pp. 692-697
-
-
Guerraoui, R.1
Larrea, M.2
Schiper, A.3
-
12
-
-
0032058184
-
The part-time parliament
-
LAMPORT, L. 1998. The part-time parliament. ACM Trans. Comput. Syst. 16, 2 (May), 133-169.
-
(1998)
ACM Trans. Comput. Syst.
, vol.16
, Issue.2 MAY
, pp. 133-169
-
-
Lamport, L.1
-
13
-
-
1242321054
-
Paxos made simple
-
Distributed Computing Column
-
LAMPORT, L. 2001. Paxos made simple. ACM SIGACT News (Distributed Computing Column) 32, 4 (Dec.), 18-25.
-
(2001)
ACM SIGACT News
, vol.32
, Issue.4 DEC
, pp. 18-25
-
-
Lamport, L.1
-
14
-
-
0037849479
-
-
Addison-Wesley, Boston, MA. A link to an electronic copy can be found online at
-
LAMPORT, L. 2003. Specifying Systems, Addison-Wesley, Boston, MA. A link to an electronic copy can be found online at http://lamport.org.
-
(2003)
Specifying Systems
-
-
Lamport, L.1
-
15
-
-
84955568437
-
How to build a highly available system using consensus
-
O. Babaoglu and K. Marzullo, Eds. Lecture Notes in Computer Science, Springer-Verlag, Berlin, Germany
-
LAMPSON, B. W. 1996. How to build a highly available system using consensus. In Distributed Algorithms, O. Babaoglu and K. Marzullo, Eds. Lecture Notes in Computer Science, vol. 1151. Springer-Verlag, Berlin, Germany, 1-17.
-
(1996)
Distributed Algorithms
, vol.1151
, pp. 1-17
-
-
Lampson, B.W.1
-
16
-
-
0020977252
-
Method for distributed transaction commit and recovery using Byzantine agreement within clusters of processors
-
The ACM Press, New York, NY
-
MOHAN, C., STRONG, R., AND FINKELSTEIN, S. 1983. Method for distributed transaction commit and recovery using Byzantine agreement within clusters of processors. In Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing. The ACM Press, New York, NY, 29-43.
-
(1983)
Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing
, pp. 29-43
-
-
Mohan, C.1
Strong, R.2
Finkelstein, S.3
-
18
-
-
84976810569
-
Reaching agreement in the presence of faults
-
PEASE, M., SHOSTAK, R., AND LAMPORT, L. 1980. Reaching agreement in the presence of faults. J. Assoc. Comput. Mach. 27, 2 (Apr.), 228-234.
-
(1980)
J. Assoc. Comput. Mach.
, vol.27
, Issue.2 APR
, pp. 228-234
-
-
Pease, M.1
Shostak, R.2
Lamport, L.3
|