The Influence of Different Workload Descriptions on a Heuristic Load Balancing Scheme
IEEE Transactions on Software Engineering
Parallel database systems: the future of high performance database systems
Communications of the ACM
A framework for workload allocation in distributed transaction processing systems
Journal of Systems and Software
Transaction routing for distributed OLTP systems: survey and recent results
Information Sciences: an International Journal - Special issue: load balancing in distributed systems
Load control for locking: the “half-and-half” approach
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Maintaining cache coherency in a multisystem data sharing environment
Journal of Systems Architecture: the EUROMICRO Journal
Dynamic Task Scheduling Using Online Optimization
IEEE Transactions on Parallel and Distributed Systems
Scheduling and Load Balancing in Parallel and Distributed Systems
Scheduling and Load Balancing in Parallel and Distributed Systems
Database recovery using incomplete page versions in a multisystem data sharing environment
Information Processing Letters
Cluster Computing
Performance Analysis of Affinity Clustering on Transaction Processing Coupling Architecture
IEEE Transactions on Knowledge and Data Engineering
Performance Analysis of Buffer Coherency Policies in a Multisystem Data Sharing Environment
IEEE Transactions on Parallel and Distributed Systems
Performance Evaluation of Transaction Processing Coupling Architectures for Handling System Dynamics
IEEE Transactions on Parallel and Distributed Systems
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Oracle Real Application Clusters
Oracle Real Application Clusters
Site Selection for Real-Time Client Request Handling
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Path conscious caching of B+ tree indexes in a shared disks cluster
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
A shared disks (SD) cluster couples multiple computing nodes for high performance transaction processing, and all nodes share a common database at the disk level. In the SD cluster, a front-end router selects a node for an incoming transaction to be executed. An affinity-based routing can increase the buffer hit ratio of each node by clustering transactions referencing similar data to be executed on the same node. However, the affinity-based routing is non-adaptive to the changes of the system load. This means that a specific node would be overloaded if corresponding transactions rush into the system. In this paper, we propose a new transaction routing algorithm, named Dynamic Affinity Cluster Allocation (DACA). DACA can make an optimal balance between the affinity-based routing and indiscriminate sharing of load in the SD cluster. As a result, DACA can increase the buffer hit ratio and reduce the frequency of inter-node buffer invalidations while achieving the dynamic load balancing.