1,551 Hits in 3.8 sec

Dynamic quorum adjustment for partitioned data

Maurice Herlihy
1987 ACM Transactions on Database Systems  
A partition occurs when functioning sites in a distributed system are unable to communicate. This paper introduces a new method for managing replicated data objects in the presence of partitions.  ...  The method permits an object's quorums to be adjusted dynamically in response to failures and recoveries.  ...  ACKNOWLEDGMENTS I am grateful to Joshua Bloch, Elliot Kolodner, Sharon Perl, and the anonymous referees for their comments and suggestions.  ... 
doi:10.1145/22952.22953 fatcat:okr7v26owffdjlvmzpjehwbkmi

Adaptive Voting for Balancing Data Integrity with Availability [chapter]

Johannes Osrael, Lorenz Froihofer, Matthias Gladt, Karl M. Goeschka
2006 Lecture Notes in Computer Science  
in different partitions.  ...  If data integrity needs to be strictly maintained even in the presence of network partitions, the system becomes (partially) unavailable since no potentially conflicting updates are allowed on replicas  ...  Re-adjustment of quorum sizes The quorum sizes of the merged partition needs to be adjusted so that the appropriate quorum conditions are obeyed.  ... 
doi:10.1007/11915072_56 fatcat:dgjoh3hqdvcalkhc3lhoxvvcjy

Quorum Based IP Address Autoconfiguration in Mobile Ad Hoc Networks

Tinghui Xu, Jie Wu
2007 27th International Conference on Distributed Computing Systems Workshops (ICDCSW'07)  
Making the compromise between message overhead and data consistency, quorum voting enforces data consistency by ensuring a fresh read upon every access so that each node is configured with a unique IP  ...  Protocols for IP address autoconfiguration can be classified into two categories.  ...  By applying dynamic linear voting algorithm to Figure 1 when cluster head 1 is the distinguished node, we could dynamically adjust the quorum sets to: {1, 2, 3}, {1, 4, 6}, which increases the probability  ... 
doi:10.1109/icdcsw.2007.68 dblp:conf/icdcsw/XuW07 fatcat:zhqjdjhfzjdtfar6w3uzczc4vq

A generic algorithm for transaction processing during network partitioning [chapter]

Bharat Bhargava, Shirley Browne
1988 Lecture Notes in Computer Science  
is determined for each logical data item.  ...  Our algorithm contains as special cases: the site quorum method in which the~is a single distinguished partition, and the virtual partition method in which a (possibly different) distinguished partition  ...  Domains can be dynamically adjusted by means of control transactions, provided that a control transaction making such an adjustment is executed in the DP for all the domains concerned.  ... 
doi:10.1007/3-540-50517-2_99 fatcat:bei5o3jbunghxjzchr2pakwt5e

Availability and Performance of the Adaptive Voting Replication

Johannes Osrael, Lorenz Froihofer, Norbert Chlaupek, Karl M. Goeschka
2007 The Second International Conference on Availability, Reliability and Security (ARES'07)  
Replica consistency and data integrity (constraint consistency) are correctness criteria for data-centric distributed systems.  ...  AV allows non-critical operations (that cannot violate critical constraints) even if no quorum exists.  ...  AV enters reconciliation mode when two or more partitions rejoin. The quorums are re-adjusted accord-ing to the size of the merged partition.  ... 
doi:10.1109/ares.2007.50 dblp:conf/IEEEares/OsraelFCG07 fatcat:aujypcdecnbqteqdn2whi3dg6q

Self Organized Replica Overlay Scheme for P2P Networks

Shashi Bhushan, Mayank Dave, R. B. Patel
2012 International Journal of Computer Network and Information Security  
Peer-to-Peer (P2P) systems are widely used for data sharing applications in an autonomous and decentralized mode.  ...  In this paper a self organized replica overlay scheme "Improved Hierarchical Quorum Consensus" (IHQC) for P2P systems is proposed.  ...  However, data replication is the basic requirement for the DDBS [14] deployed on the networks that are dynamic in nature for example P2P systems [15] .  ... 
doi:10.5815/ijcnis.2012.10.02 fatcat:ghjqvqiddrcezdy4wsr27ybpdm

Application-based dynamic primary views in asynchronous distributed systems

Alberto Bartoli, Ozalp Babaoglu
2003 Journal of Parallel and Distributed Computing  
In this paper we propose a mechanism for efficiently deciding when a view constitutes the "primary partition" for the group.  ...  Our solution is highly flexible and has the following features: possibility to modify selection rules at run-time without having to halt and restart the application; support for dynamic groups whose membership  ...  Acknowledgments The authors are grateful to the anonymous referees for their detailed and constructive comments. This work has been partially supported by Microsoft Research (Cambridge, UK).  ... 
doi:10.1016/s0743-7315(03)00016-9 fatcat:wq3os7yeizhldkyymsle36sq6e

An Evaluation Framework of Replication Protocols in Mobile Environment

Archana Sharma, Vineet Kansal
2013 International Journal of Database Management Systems  
For dynamically evolving environments to provide connectivity and reasonable use of shared resources adaptability is vital.  ...  Conventional data sharing systems are based on presumption that connections are reliable, and a faulty operation will be considered in case of losing a connection.  ...  Dynamic group membership for the authoring of data included in this category. • Good availability is assigned in case if it is possible to utilize data in dynamic network partitioning excluding the most  ... 
doi:10.5121/ijdms.2013.5104 fatcat:foo2xcy7y5atbc32qqpcpgtoye

Advanced consistency management of highly-distributed transactional database in a hybrid cloud environment using novel R-TBC/RTA approach

Jasmina Dizdarevic, Zikrija Avdagic, Fahrudin Orucevic, Samir Omanovic
2021 Journal of Cloud Computing: Advances, Systems and Applications  
Regarding implementation, a specific agglomerative Rose Tree Algorithm (RTA) has been developed, based on Bayesian hierarchical clustering and Graph Partitioning Algorithm - Multidimensional Data Clustering  ...  With a detailed analysis of the existing consistency models for distributed database and standard strategies including Classic, Quorum and Tree Based Consistency (TBC), it is concluded that an improved  ...  At the same time comes horizontal data partitioning with generating larger range partitions, and then vertical partitioning by key attributes or data dimensions.  ... 
doi:10.1186/s13677-021-00230-0 fatcat:unuvwp3ok5he5dmmzdzsqif7nm

An algorithm, for replicated directories

Dean Daniels, Alfred Z. Spector
1983 Proceedings of the second annual ACM symposium on Principles of distributed computing - PODC '83  
This paper describes a replication algorithm for directory objects based upon Gifford's weighted voting for files.  ...  The range of keys associated with a version number changes dynamically; but in all instances, a separate version number is associated with each entry stored on every replica.  ...  Acknowledgments James Driscoll suggested improvements to our initial dynamic partitioning algorithm that resulted in the algorithm presented in this paper.  ... 
doi:10.1145/800221.806713 dblp:conf/podc/DanielsS83 fatcat:56jbtm7r3rcztexsmh3v5ksgjm

An algorithm for replicated directories

Alfred Z Spector, Dean Daniels
1986 ACM SIGOPS Operating Systems Review  
This paper describes a replication algorithm for directory objects based upon Gifford's weighted voting for files.  ...  The range of keys associated with a version number changes dynamically; but in all instances, a separate version number is associated with each entry stored on every replica.  ...  Acknowledgments James Driscoll suggested improvements to our initial dynamic partitioning algorithm that resulted in the algorithm presented in this paper.  ... 
doi:10.1145/12485.12489 fatcat:n5qq7umybfhjjmm23hri735qfq

Adapting Commit Protocols for Large-Scale and Dynamic Distributed Applications [chapter]

Pawel Jurczyk, Li Xiong
2008 Lecture Notes in Computer Science  
The continued advances in distributed data intensive applications have formed an increasing demand for distributed commit protocols that are adaptive to large scale and dynamic nature of the applications  ...  Most importantly, it offers a set of adjustable parameters for a desired level of consistency at lowest cost depending on specific requirements of different applications.  ...  One of the key desired properties for building such large scale and dynamic distributed data intensive applications is to guarantee data consistency and integrity.  ... 
doi:10.1007/978-3-540-88871-0_33 fatcat:wrbinkuxabdwdcdjeujzs6vuvi

A survey of permission-based distributed mutual exclusion algorithms

P.C. Saxena, J. Rai
2003 Computer Standards & Interfaces  
Acknowledgements The authors are thankful to the reviewers for their valuable comments. It would not have been possible for us to put the paper in its present form without their useful suggestions.  ...  Rabinovich and Lazowska [75] propose a mechanism that allows dynamic adjustment of quorum sets when quorums are defined based on a logical network structure.  ...  The protocol provides high data availability and low response time. The algorithm dynamically searches for a quorum but all possible quorums are fixed a priori.  ... 
doi:10.1016/s0920-5489(02)00105-8 fatcat:na3u3ho6tzayle5qd7vlnchpmu

The performance of available copy protocols for the management of replicated data

Jehan-François Pâris, Darrell D.E Long
1990 Performance evaluation (Print)  
Available copy protocols guarantee the consistency of replicated data objects against any combination of non-Byzantine failures that do not result in partial communication failures.  ...  These protocols are shown to perform nearly as well as the original available copy protocol, which is shown to perform much better than quorum consensus protocols.  ...  We are also grateful to John Carroll for his many contributions to this work. The second author is especially indebted to Ernestine McKinney for her assistance and encouragement.  ... 
doi:10.1016/0166-5316(90)90024-d fatcat:inaman2phnbntns26ganilo4pu

Evaluating the Impact of Network Partitions on Replicated Data Availability [chapter]

Jehan-François Pâris
1992 Dependable Computing for Critical Applications 2  
Many distributed systems maintain multiple replicas of their critical data to protect these data against equipment failures.  ...  We illustrate our technique by comparing the availabilities of replicated objects with three replicas managed by majority consensus voting (MCV), and dynamic-linear voting (DLV), under three different  ...  Acknowledgements We wish to thank Elizabeth Pa ˆris for her editorial comments.  ... 
doi:10.1007/978-3-7091-9198-9_3 fatcat:fqh3du7prnf7xloq3ucfq42vbe
« Previous Showing results 1 — 15 out of 1,551 results