S. Cheung, M. Ahamad, and M. H. Ammar. Optimizing Vote and Quorum Assignments for Reading and Writing Replicated Data. IEEE Transactions on Knowlegde and Data Engineering, 1(3):387--397, September 1989. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Replicated Data Management in Distributed Systems - Ahamad, Ammar, Cheung (1992) (4 citations) (Correct)
....In [GB85] an enumeration method is presented that generates a subset of the quorum sets used for synchronizing operations that require mutual exclusion. Each group of the quorum set must intersect with every group in the set to guarantee mutual exclusion and such sets are called coteries. In [CAA89], an enumeration algorithm was presented to obtain all read and write quorum sets that are defined by SD voting. 6 Available Copies 6.1 The Basic Method The easiest way to handle node failures is to ignore them. In the basic available copies method, updates are applied to replicas at nodes that ....
S. Y. Cheung, M. Ahamad, and M. H. Ammar. Optimizing vote and quorum assignments for reading and writing replicated data. IEEE Transactions on Knowlegde and Data Engineering, 1(3):387--397, September 1989.
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, ....
S.Y. Cheung, M. Ahamad, and M.H. Ammar. Optimizing vote and quorum assignments for reading and writing replicated data. IEEE Transactions on Knowledge and Data Engineering, 1(3):387--397, September 1989.
A Token Based Distributed Mutual Exclusion Algorithm based .. - Mizuno, Neilsen, Rao (1991) (3 citations) (Correct)
....projective plane for N = 7 is shown in Table 1. Table 1 q 1 q 2 q 3 q 4 q 5 q 6 q 7 1 2 3 1 2 1 3 2 4 5 4 5 6 4 3 6 6 5 7 7 7 Weighted voting may be used to generate quorum agreements [2] Cheung, et al. discussed enumeration and generation of efficient quorum agreements using weighted voting [3]. The grid protocol proposed by Maekawa [6] and by Agrawal and El Abbadi [1] may be modified to obtain quorum agreements. Each node is assigned a location on a rectangular a r ( N ) grid. Quorums in Q and Q Gamma1 are formed by choosing all elements in one row and one element from each row, ....
S.Y. Cheung, M. Ahamad, and M.H. Ammar. Optimizing vote and quorum assignments for reading and writing replicated data. IEEE Transactions on Knowledge and Data Engineering, 1(3):387-- 397, 1989.
Replication Management in Large Networks - Freisleben, Koch, Theel (1991) (Correct)
....is based on a fixed number of replicas, it is necessary to either dynamically adjust the number of votes or the quorum sizes when the number of replicas changes. Both approaches have been proposed to increase the availability of replicated data in the presence of network partitioning failures [2, 5, 12]. Whatever type of adjustment is employed, it is essential to keep the number of nodes which must be informed about the change small, because otherwise the vote or quorum reassigment protocol is susceptible to severe performance penalties due to the large amount of communication overhead involved. ....
S.Y. Cheung, M. Ahamad, and M.A. Ammar. Optimizing Vote and Quorum Assignments for Reading and Writing Replicated Data. IEEE Transactions on Knowledge and Data Engineering, 1(3):387--397, 1989.
Highly Available Replicated Atomic Data - Maugis (1994) (Correct)
....is a collections of intersecting minimal subsets of sites. Interestingly, if the system has six or more nodes, there exist several coteries that do not have equivalent quorum assignments. A logical structure based on grids is also presented in Cheung, Ammar and Ahamad [25] Ahamad and Ammar [4, 24] evaluated the performance of quorum based protocols when data becomes unavailable. Barbara and Garcia Molina [9, 10] studied the vulnerability of voting assignment in the presence of failures. Kumar and Segev [52] proposed heuristics to minimize communication costs under availability constraints. ....
S. Y. Cheung, M. Ahamad, and M. H. Ammar. Optimizing vote and quorum assignments for reading and writing replicated data. IEEE Transactions on Knowledge and Data Engineering, 1(3):387, September 1989.
Providing Low Cost Read Access to Replicated Data with.. - Freisleben, Koch, Theel (Correct)
....is based on a fixed number of replicas, it is necessary to either dynamically adjust the number of votes or the quorum sizes when the number of replicas changes. Both approaches have been proposed to increase the availability of replicated data in the presence of network partitioning failures [3, 9]. Whatever type of adjustment is employed, it is essential to keep the number of nodes which must be informed about the change small, because otherwise the vote or quorum reassignment protocol is susceptible to severe performance penalties due to the large amount of communication overhead ....
S.Y. Cheung, M. Ahamad, , and M.A. Ammar. Optimizing Vote and Quorum Assignments for Reading and Writing Replicated Data. IEEE Transactions on Knowledge and Data Engineering, 1(3):387--397, 1989.
Two Approaches for High Concurrency in Multicast-Based Object .. - Johnson, Maugis (1994) (3 citations) (Correct)
....is a collections of intersecting minimal subsets of sites. Interestingly, if the system has six or more nodes, there exist several coteries that do not have equivalent quorum assignments. A logical structure based on grids is also presented in Cheung, Ammar and Ahamad [26] Ahamad and Ammar [4, 25] evaluated the performance of quorum based protocols when data becomes unavailable. Barbara and Garcia Molina [9, 10] studied the vulnerability of voting assignment in the presence of failures. Kumar and Segev [54] proposed heuristics to minimize communication costs under availability constraints. ....
S. Y. Cheung, M. Ahamad, and M. H. Ammar. Optimizing vote and quorum assignments for reading and writing replicated data. IEEE Transactions on Knowledge and Data Engineering, 1(3):387, September 1989.
Improving Availability and Performance with.. - Gao, Dahlin.. (Correct)
No context found.
S. Cheung, M. Ahamad, and M. H. Ammar. Optimizing Vote and Quorum Assignments for Reading and Writing Replicated Data. IEEE Transactions on Knowlegde and Data Engineering, 1(3):387--397, September 1989.
Application Specific Data Replication for Edge Services - Gao, Dahlin, Nayate.. (2003) (11 citations) (Correct)
No context found.
S. Y. Cheung, M. Ahamad, and M. H. Ammar. Optimizing Vote and Quorum Assignments for Reading and Writing Replicated Data. IEEE Transactions on Knowlegde and Data Engineering, 1(3):387--397, September 1989.
Order-P: An Algorithm to Order Network Partitionings - Banerjee, Li (Correct)
No context found.
S. Y. Cheung, M. Ahamad, and M. H. Ammar, "Optimizing Vote and Quorum Assignments for Reading and Writing Replicated Data," IEEE Transactions on Knowledge and Data Engineering, vol. 1 (1989 September), pp. 387--397.
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