Checkpointing and Rollback-Recovery for Distributed Systems
IEEE Transactions on Software Engineering - Special issue on distributed systems
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Fast Algorithms for Maintaining Replica Consistency in Lazy Master Replicated Databases
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Fine-grained replication and scheduling with freshness and correctness guarantees
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Preventive Replication in a Database Cluster
Distributed and Parallel Databases
MIDDLE-R: Consistent database replication at the middleware level
ACM Transactions on Computer Systems (TOCS)
Group-Based Dynamic Computational Replication Mechanism in Peer-to-Peer Grid Computing
CCGRID '06 Proceedings of the Sixth IEEE International Symposium on Cluster Computing and the Grid
The leganet system: Freshness-aware transaction routing in a database cluster
Information Systems
Hi-index | 0.01 |
Grid systems provide access to huge storage and computing resources at large scale. While they have been mainly dedicated to scientific computing for years, grids are now considered as a viable solution for hosting data-intensive applications. To this end, databases are replicated over the grid in order to achieve high availability and fast transaction processing thanks to parallelism. However, achieving both fast and consistent data access on such architectures is challenging at many points. In particular, centralized control is prohibited because of its vulnerability and lack of efficiency at large scale. In this article, we propose a novel solution for the distributed control of transaction routing in a large scale network. We leverage a cluster-oriented routing solution with a fully distributed approach that uses a large scale distributed directory to handle routing metadata. Moreover, we demonstrate the feasibility of our implementation through experimentation: results expose linear scale-up, and transaction routing time is fast enough to make our solution eligible for update intensive applications such as world wide online booking.