Managing update conflicts in Bayou, a weakly connected replicated storage system
SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
The dangers of replication and a solution
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Locality-aware request distribution in cluster-based network servers
Proceedings of the eighth international conference on Architectural support for programming languages and operating systems
Logical vs. physical file system backup
OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
Anatomy of a real E-commerce system
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Transactional information systems: theory, algorithms, and the practice of concurrency control and recovery
The Informix Handbook with Cdrom
The Informix Handbook with Cdrom
Prototyping Bubba, A Highly Parallel Database System
IEEE Transactions on Knowledge and Data Engineering
Don't Be Lazy, Be Consistent: Postgres-R, A New Way to Implement Database Replication
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Optimistic Replication for Internet Data Services
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Kqueue - A Generic and Scalable Event Notification Facility
Proceedings of the FREENIX Track: 2001 USENIX Annual Technical Conference
Database Replication Techniques: A Three Parameter Classification
SRDS '00 Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems
Using Broadcast Primitives in Replicated Databases
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
Neptune: scalable replication management and programming support for cluster-based network services
USITS'01 Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3
HACC: an architecture for cluster-based web servers
WINSYM'99 Proceedings of the 3rd conference on USENIX Windows NT Symposium - Volume 3
Ganymed: scalable replication for transactional web applications
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
Quantifying the Performability of Cluster-Based Services
IEEE Transactions on Parallel and Distributed Systems
A Comparative Evaluation of Transparent Scaling Techniques for Dynamic Content Servers
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Scalable database replication through dynamic multiversioning
CASCON '05 Proceedings of the 2005 conference of the Centre for Advanced Studies on Collaborative research
Online data migration for autonomic provisioning of databases in dynamic content web servers
CASCON '05 Proceedings of the 2005 conference of the Centre for Advanced Studies on Collaborative research
Exploiting distributed version concurrency in a transactional memory cluster
Proceedings of the eleventh ACM SIGPLAN symposium on Principles and practice of parallel programming
Transactional file systems can be fast
Proceedings of the 11th workshop on ACM SIGOPS European workshop
Reactive provisioning of backend databases in shared dynamic content server clusters
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Database replication policies for dynamic content applications
Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
The leganet system: Freshness-aware transaction routing in a database cluster
Information Systems
Analysis of Caching and Replication Strategies for Web Applications
IEEE Internet Computing
Tashkent+: memory-aware load balancing and update filtering in replicated databases
Proceedings of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems 2007
Autonomic power and performance management for computing systems
Cluster Computing
Conflict-aware load-balancing techniques for database replication
Proceedings of the 2008 ACM symposium on Applied computing
Middleware-based database replication: the gaps between theory and practice
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Correctness Criteria for Database Replication: Theoretical and Practical Aspects
OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part I on On the Move to Meaningful Internet Systems:
Agent-based replication for scaling back-end databases of dynamic content web sites
ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
Specification and implementation of dynamic web site benchmark in telecommunication area
ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
DDoS-shield: DDoS-resilient scheduling to counter application layer attacks
IEEE/ACM Transactions on Networking (TON)
Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware
RAIDb: redundant array of inexpensive databases
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Consistent data replication: is it feasible in WANs?
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Facing peak loads in a P2P transaction system
Proceedings of the First Workshop on P2P and Dependability
Hi-index | 0.00 |
We present a new lazy replication technique, suitable for scaling the back-end database of a dynamic content site using a cluster of commodity computers. Our technique, called conflict-aware scheduling, provides both throughput scaling and 1-copy serializability. It has generally been believed that this combination is hard to achieve through replication because of the growth of the number of conflicts. We take advantage of the presence in a database cluster of a scheduler through which all incoming requests pass. We require that transactions specify the tables that they access at the beginning of the transaction. Using that information, a conflictaware scheduler relies on a sequence-numbering scheme to implement 1-copy serializability, and directs incoming queries in such a way that the number of conflicts is reduced. We evaluate conflict-aware scheduling using the TPCW e-commerce benchmark. For small clusters of up to eight database replicas, our evaluation is performed through measurements of a web site implementing the TPC-W specification. We use simulation to extend our measurement results to larger clusters, faster database engines, and lower conflict rates. Our results show that conflict-awareness brings considerable benefits compared to both eager and conflict-oblivious lazy replication for a large range of cluster sizes, database speeds, and conflict rates. Conflict-aware scheduling provides near-linear throughput scaling up to a large number of database replicas for the browsing and shopping workloads of TPC-W. For the write-heavy ordering workload, throughput scales, but only to a smaller number of replicas.