How to assign votes in a distributed system

Journal of the ACM - Tập 32 Số 4 - Trang 841-860 - 1985
Héctor García-Molina1, Daniel Barbará1
1Princeton Univ., Princeton, NJ

Tóm tắt

In a distributed system, one strategy for achieving mutual exclusion of groups of nodes without communication is to assign to each node a number of votes. Only a group with a majority of votes can execute the critical operations, and mutual exclusion is achieved because at any given time there is at most one such group. A second strategy, which appears to be similar to votes, is to define a priori a set of groups that intersect each other. Any group of nodes that finds itself in this set can perform the restricted operations. In this paper, both of these strategies are studied in detail and it is shown that they are not equivalent in general (although they are in some cases). In doing so, a number of other interesting properties are proved. These properties will be of use to a system designer who is selecting a vote assignment or a set of groups for a specific application.

Từ khóa


Tài liệu tham khảo

BENZAKEN , C. Critical hypergraphs for the weak chromatic number . J. Comb. Theory, Series B 29 , ( 1980 ), 328 - 338 . BENZAKEN, C.Critical hypergraphs for the weak chromatic number. J. Comb. Theory, Series B 29, (1980), 328-338.

BERGE , C. Graphs and Hypergraphs . American Elsevier , New York , 1973 . BERGE, C. Graphs and Hypergraphs. American Elsevier, New York, 1973.

DAVIDSON , S. Evaluation of an optimistic protocol for partitioned distributed database systems. Tech. Rep. 299, Dept. of Electrical Engineering and Comput. Sci ., Princeton Univ. , May 1982 . DAVIDSON, S.Evaluation of an optimistic protocol for partitioned distributed database systems. Tech. Rep. 299, Dept. of Electrical Engineering and Comput. Sci., Princeton Univ., May 1982.

DOLEV , D. , AND STRONG , H. R. polynomial algorithms for multiple processor agreement . In Proceedings of the 14th ACM Symposium on Theory of Computing ( San Francisco, Calif., May 5-7). ACM, New York , 1982 , pp. 401 - 407 . 10.1145/800070.802215 DOLEV, D., AND STRONG, H. R.polynomial algorithms for multiple processor agreement. In Proceedings of the 14th ACM Symposium on Theory of Computing (San Francisco, Calif., May 5-7). ACM, New York, 1982, pp. 401-407. 10.1145/800070.802215

GARCIA-MOLINA , H. Reliability issues for fully replicated distributed databases . IEEE Trans. Comput. 15 , 9 ( Sept. 1982 ) 34-42. GARCIA-MOLINA, H.Reliability issues for fully replicated distributed databases. IEEE Trans. Comput. 15, 9 (Sept. 1982) 34-42.

FFORD , Do K~ Weighted voting for replicated data . In Proceedings of the 7th Symposium on Operating System Principles (Pacific Grove, Calif., Dec.). ACM , New York , 1979 , pp. 150 - 162 . 10.1145/800215.806583 FFORD, Do K~ Weighted voting for replicated data. In Proceedings of the 7th Symposium on Operating System Principles (Pacific Grove, Calif., Dec.). ACM, New York, 1979, pp. 150-162. 10.1145/800215.806583

LAMPORT , L. The implementation of reliable distributed multiprocess systems . Comput. Networks 2 ( 1978 ), 95 - 114 . LAMPORT, L.The implementation of reliable distributed multiprocess systems. Comput. Networks 2 (1978), 95-114.

10.1145/357172.357176

LOVASZ , L . On chromatic number of finite set systems . Acta Math. Acad. Sci. Hungary 19 (I968), 59 - 67 . LOVASZ, L. On chromatic number of finite set systems. Acta Math. Acad. Sci. Hungary 19 (I968), 59-67.

LOVASZ , L. Coverings and colorings of hypergraphs . In Proceedings of the 4th Southeastern Conference on Combinatorics, Graph Theory and Computing ( Florida Atlantic University). Utilitas Mathematica, Winnipeg, Canada , 1973 , pp. 3 - 12 . LOVASZ, L. Coverings and colorings of hypergraphs. In Proceedings of the 4th Southeastern Conference on Combinatorics, Graph Theory and Computing (Florida Atlantic University). Utilitas Mathematica, Winnipeg, Canada, 1973, pp. 3-12.

LYNCH , N. FISCHER , M. , AND FOWLER , R. A simple and efficient byzantine generals algorithm . In Proceedings of the 2nd Symposium on Reliability in Distributed Software and Database Systems ( Univ. of Pittsburgh, July). iEEE, New York, i982 , pp. 46 - 52 . LYNCH, N. FISCHER, M., AND FOWLER, R. A simple and efficient byzantine generals algorithm. In Proceedings of the 2nd Symposium on Reliability in Distributed Software and Database Systems (Univ. of Pittsburgh, July). iEEE, New York, i982, pp. 46-52.

ROTHNIE , J. B. , AND GOODMAN , N. A survey of research and development in distributed database management . In Proceedings of the 3rd International Conference on Very Large Database ( Tokyo, Japan, Oct. 6-8). ACM, New York , 1977 , pp. 48 - 62 . ROTHNIE, J. B., AND GOODMAN, N.A survey of research and development in distributed database management. In Proceedings of the 3rd International Conference on Very Large Database (Tokyo, Japan, Oct. 6-8). ACM, New York, 1977, pp. 48-62.

SKEEN , D. A quorum-based commit protocol . In Proceedings of the 6th Berkeley Workshop on Distributed Data Management and Computer Networks (Asilomar, Calif., Feb.). Lawrence Berkeley Laboratories , Berkeley, Calif. , 1982 , pp. 69 - 80 . SKEEN, D.A quorum-based commit protocol. In Proceedings of the 6th Berkeley Workshop on Distributed Data Management and Computer Networks (Asilomar, Calif., Feb.). Lawrence Berkeley Laboratories, Berkeley, Calif., 1982, pp. 69-80.

10.1145/320071.320076