-
3
-
-
0029700755
-
On the impossibility of group membership
-
New York, USA, May ACM
-
T. D. Chandra, V. Hadzilacos, S. Toueg, and B. Charron-Bost. On the impossibility of group membership. In Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing (PODC'96), pages 322-330, New York, USA, May 1996. ACM.
-
(1996)
Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing (PODC'96)
, pp. 322-330
-
-
Chandra, T.D.1
Hadzilacos, V.2
Toueg, S.3
Charron-Bost, B.4
-
4
-
-
0026104130
-
Understanding fault-tolerant distributed systems
-
Feb.
-
F. Cristian. Understanding fault-tolerant distributed systems. Communications of the ACM, 34(2):56-78, Feb. 1991.
-
(1991)
Communications of the ACM
, vol.34
, Issue.2
, pp. 56-78
-
-
Cristian, F.1
-
6
-
-
0002112484
-
Epidemic algorithms for replicated database maintenance
-
Jan.
-
A. Demers, D. Greene, H. C., W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry. Epidemic algorithms for replicated database maintenance. ACM Operating Systems Review, SIGOPS, 22(1):8-32, Jan. 1988.
-
(1988)
ACM Operating Systems Review, SIGOPS
, vol.22
, Issue.1
, pp. 8-32
-
-
Demers, A.1
Greene, D.2
C, H.3
Irish, W.4
Larson, J.5
Shenker, S.6
Sturgis, H.7
Swinehart, D.8
Terry, D.9
-
7
-
-
0040684856
-
Parallel branch-and-bound algorithms for general mixed integer programming on the CM-5
-
J. Eckstein. Parallel branch-and-bound algorithms for general mixed integer programming on the CM-5. SIAM Journal on Optimization, 4:794-814, 1994.
-
(1994)
SIAM Journal on Optimization
, vol.4
, pp. 794-814
-
-
Eckstein, J.1
-
8
-
-
3543099582
-
How much communication does parallel branch and bound need?
-
J. Eckstein. How much communication does parallel branch and bound need? INFORMS Journal on Computing, 9:15-29, 1997.
-
(1997)
INFORMS Journal on Computing
, vol.9
, pp. 15-29
-
-
Eckstein, J.1
-
9
-
-
0018998813
-
Minimum-time broadcast networks
-
A. Farley. Minimum-time broadcast networks. Networks, 10:59-70, 1980.
-
(1980)
Networks
, vol.10
, pp. 59-70
-
-
Farley, A.1
-
11
-
-
0022045868
-
Impossibility of distributed consensus with one faulty process
-
Apr.
-
M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374-382, Apr. 1985.
-
(1985)
Journal of the ACM
, vol.32
, Issue.2
, pp. 374-382
-
-
Fischer, M.J.1
Lynch, N.A.2
Paterson, M.S.3
-
13
-
-
0345415768
-
Fundamentals of fault-tolerant distributed computing in asynchronous environments
-
Mar.
-
F. C. Gärtner. Fundamentals of fault-tolerant distributed computing in asynchronous environments. ACM Computing Surveys, 31(1):1-26, Mar. 1999.
-
(1999)
ACM Computing Surveys
, vol.31
, Issue.1
, pp. 1-26
-
-
Gärtner, F.C.1
-
14
-
-
0028550919
-
Parallel branch-and-bound algorithms: Survey and synthesis
-
B. Gendron and T. G. Crainic. Parallel branch-and-bound algorithms: survey and synthesis. Operations Research, 42:1042-1066, 1994.
-
(1994)
Operations Research
, vol.42
, pp. 1042-1066
-
-
Gendron, B.1
Crainic, T.G.2
-
15
-
-
0003644862
-
-
Technical Report University of California, Santa Cruz, Jack Baskin School of Engineering, Mar.
-
R. A. Golding and K. Taylor. Group membership in the epidemic style. Technical Report UCSC-CRL-92-13, University of California, Santa Cruz, Jack Baskin School of Engineering, Mar. 1992.
-
(1992)
Group Membership in the Epidemic Style
-
-
Golding, R.A.1
Taylor, K.2
-
16
-
-
0002088086
-
Scalable load balancing techniques for parallel computers
-
July
-
V. Kumar, A. Y. Grama, and N. R. Vempaty. Scalable load balancing techniques for parallel computers. Journal of Parallel and Distributed Computing, 22(1):60-79, July 1994.
-
(1994)
Journal of Parallel and Distributed Computing
, vol.22
, Issue.1
, pp. 60-79
-
-
Kumar, V.1
Grama, A.Y.2
Vempaty, N.R.3
-
18
-
-
0003912256
-
-
Technical Report University of Wisconsin, Madison, Apr.
-
M. Litzkow, T. Tannenbaum, J. Basney, and M. Livny. Checkpoint and migration of UNIX processes in the Condor distributed processing system. Technical Report CS-TR-1997-1346, University of Wisconsin, Madison, Apr. 1997.
-
(1997)
Checkpoint and Migration of UNIX Processes in the Condor Distributed Processing System
-
-
Litzkow, M.1
Tannenbaum, T.2
Basney, J.3
Livny, M.4
-
19
-
-
0024138827
-
Condor - A hunter of idle workstations
-
San Jose, Calif., June
-
M. J. Litzkow, M. Livny, and M. W. Mutka. Condor - A hunter of idle workstations. In Proc. 8th Intl. Conf. on Distributed Computing Systems, pages 104-111, San Jose, Calif., June 1988.
-
(1988)
Proc. 8th Intl. Conf. on Distributed Computing Systems
, pp. 104-111
-
-
Litzkow, M.J.1
Livny, M.2
Mutka, M.W.3
-
20
-
-
0026158986
-
Membership algorithms for asynchronous distributed systems
-
Washington, D.C., USA, May IEEE Computer Society Press
-
L. E. Moser, P. M. Melliar-Smith, and V. Agrawala. Membership algorithms for asynchronous distributed systems. In 11th International Conference on Distributed Computing Systems, pages 480-489, Washington, D.C., USA, May 1991. IEEE Computer Society Press.
-
(1991)
11th International Conference on Distributed Computing Systems
, pp. 480-489
-
-
Moser, L.E.1
Melliar-Smith, P.M.2
Agrawala, V.3
-
23
-
-
0002411371
-
What good are models and what models are good?
-
S. Mullender, editor, chapter 2, Addison-Wesley, second edition
-
F. B. Schneider. What good are models and what models are good? In S. Mullender, editor, Distributed Systems, chapter 2, pages 17-26. Addison-Wesley, second edition, 1993.
-
(1993)
Distributed Systems
, pp. 17-26
-
-
Schneider, F.B.1
-
24
-
-
84949518746
-
-
SETI@home. http://setiathome.ssl.berkeley.edu.
-
-
-
-
25
-
-
77952176829
-
A fault detection service for wide area distributed computations
-
IEEE
-
P. Stelling, I. Foster, C. Kesselman, C. Lee, and G. von Laszewski. A fault detection service for wide area distributed computations. In Proceedings of the 7th IEEE International Symposium on High Performance Distributed Computing, pages 268-278. IEEE, 1998.
-
(1998)
Proceedings of the 7th IEEE International Symposium on High Performance Distributed Computing
, pp. 268-278
-
-
Stelling, P.1
Foster, I.2
Kesselman, C.3
Lee, C.4
Von Laszewski, G.5
-
27
-
-
84949487245
-
-
UCLA Parallel Computing Laboratory. Parsec. http://may.cs.ucla.edu/projects/parsec.
-
Parsec
-
-
-
28
-
-
0008851744
-
-
Technical Report Cornell University, Computer Science Department, Aug.
-
R. van Renesse, T. M. Hickey, and K. P. Birman. Design and performance of Horus: A lightweight group communications system. Technical Report TR94-1442, Cornell University, Computer Science Department, Aug. 1994.
-
(1994)
Design and Performance of Horus: A Lightweight Group Communications System
-
-
Van Renesse, R.1
Hickey, T.M.2
Birman, K.P.3
-
29
-
-
0011836936
-
-
Technical Report Cornell University, Computer Science, May
-
R. van Renesse, Y. Minsky, and M. Hayden. A gossip-style failure detection service. Technical Report TR98-1687, Cornell University, Computer Science, May 1998.
-
(1998)
A Gossip-style Failure Detection Service
-
-
Van Renesse, R.1
Minsky, Y.2
Hayden, M.3
|