D. Barbara, H. Garcia-Molina, and A. Spauster. Policies for dynamic vote reassignment. Proceedings of 6th International Conference on Distributed Computing Systems (Cambridge, Mass), pages 37-44. IEEE Computer Society Press, Catalog number 86CH22293-9, May 1986. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Voting and Relocation Strategies Preserving Consistency among.. - Borghoff (Correct)
....Theory (ICDT 90) Paris, France, Dec. 1990. Lecture Notes in Computer Science 470. Berlin, Heidelberg, New York: Springer Verlag, pages 318 332 y e mail: borghoff lan.informatik.tu muenchen.dbp.de Voting Strategy Transparent access to replicated files has been extensively investigated [3, 4, 8, 10, 12, 13, 16, 17, 19, 20, 28, 29, 31, 35, 36, 39, 40, 41, 46]. The replication method proposed here is a modification of a file replication method due to Thomas [45] and Gifford [24] Our method encompasses replication methods that allow for dynamic changes of the degree of replication as well as for dynamic changes of the location of replicas [21, 26, 27, ....
D. Barbara, H. Garcia-Molina, and A. Spauster. Policies for dynamic vote reassignment. In Proc. 6th IEEE Int. Conf. on Distributed Computing Systems, pages 37--44, Cambridge, MA, May 1986. Los Alamitos, CA: IEEE Comp. Soc. Press.
An Efficient Protocol for Voting in Distributed Systems - Agrawal, Jalote (1992) (2 citations) (Correct)
....of these nodes then have the version number as one more than the highest version number. The quorum conditions ensure that a node with the highest of the version numbers in a read write quorum has the latest copy of the data. Many further improvements of voting algorithm have also been suggested [2, 3, 4, 5, 8, 10, 11, 16, 17, 18, 19]. The voting scheme has a high communication cost, a request for an operation is typically send to all the sites in the system and a group of sites constituting a majority of votes satisfies the quorum. Some extensions of the voting algorithm have been proposed to reduce the communication costs ....
D.Barbara, H.G.Molina and A.Spauster, "Policies for dynamic vote reassignment", in proc. of sixth IEEE conf. on dist. computing sys. , pp. 3744, June 1986.
Transparent Remote Procedure Calls - Abram (1992) (Correct)
....majority consensus voting is to create witnesses. Witnesses are not data objects; they are records of the state of the data object [33] A witness must be a part of the quorum when the voting entity reads data objects. Other modifications of these simple algorithms include dynamic vote adjustment [4] and dynamic quorum adjustment [28] protocols. These algorithms make a distributed database more sensitive to changes in its configuration, and this increases the robustness of the database. Improving the voting algorithm in the distributed database is another goal for our package in the future. ....
D. Barbara, H. Garcia-Molina, and A. Spauster. Policies for dynamic vote reassignment. In Proceedings of the 6th International Conference on Distributed Computing Systems, pages 37--44, Cambridge, 1986. IEEE.
Rice88] J.A. Rice. Mathematical statistics and data.. - Schroeder Schroeder.. (Correct)
No context found.
D. Barbara, H. Garcia-Molina, and A. Spauster. Policies for dynamic vote reassignment. Proceedings of 6th International Conference on Distributed Computing Systems (Cambridge, Mass), pages 37-44. IEEE Computer Society Press, Catalog number 86CH22293-9, May 1986.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC