Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
An efficient and fault-tolerant solution for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data
IEEE Transactions on Computers
Delay-Optimal Quorum Consensus for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data
IEEE Transactions on Knowledge and Data Engineering
The Tree Quorum Protocol: An Efficient Approach for Managing Replicated Data
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
BRITE: An Approach to Universal Topology Generation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Recent Research Advances in e-Science
Cluster Computing
Dynamic hybrid replication effectively combining tree and grid topology
The Journal of Supercomputing
Hi-index | 0.00 |
As part of a service oriented e-Science and Grid infrastructure, a quorum-consensus method is a valuable tool for managing replicated data and finding meaningful patterns of immense data sets. In general, a workflow is defined as set of atomic tasks that may have dependencies between each other. Tasks also may define a so-called "quorum" which denotes a number of precedence constraints to be fulfilled before execution may proceed. To solve the problem of designing a quorum that fits a scalable and dynamic environment where data are distributed sparsely or too far apart, we propose a cell approximation method to fit into some form (e.g., voting, grid) of logical structure in quorum-based protocols. In our method, adjacent nodes are configured by an Intra cell which can improve their data locality. Furthermore, Intra-cell relationships can be represented by an Inter cell for minimizing access time.