Quantitative system performance: computer system analysis using queueing network models
Quantitative system performance: computer system analysis using queueing network models
Optimal static load balancing in distributed computer systems
Journal of the ACM (JACM)
An introduction to database systems: vol. I (4th ed.)
An introduction to database systems: vol. I (4th ed.)
Adaptive load sharing in homogeneous distributed systems
IEEE Transactions on Software Engineering
On multisystem coupling through function request shipping
IEEE Transactions on Software Engineering
A comparison of receiver-initiated and sender-initiated adaptive load sharing
Performance Evaluation
Load balancing in a locally distributed DB system
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Dynamic Transaction Routing in Distributed Database Systems
IEEE Transactions on Software Engineering
A Trace-Driven Simulation Study of Dynamic Load Balancing
IEEE Transactions on Software Engineering
A perspective on queueing models of computer performance
Performance Evaluation
Mean-Value Analysis of Closed Multichain Queuing Networks
Journal of the ACM (JACM)
A load index for dynamic load balancing
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
An architecture for high volume transaction processing
ISCA '85 Proceedings of the 12th annual international symposium on Computer architecture
A model of shared DASD and multipathing
Communications of the ACM
GAMMA - A High Performance Dataflow Database Machine
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
SOSP '81 Proceedings of the eighth ACM symposium on Operating systems principles
A Performance Study of Robust Distributed Load Sharing Strategies
IEEE Transactions on Parallel and Distributed Systems
Adaptive algorithms for managing a distributed data processing workload
IBM Systems Journal
A Management Architecture for Measuring and Monitoring the Behavior of Digital Libraries
ECDL '98 Proceedings of the Second European Conference on Research and Advanced Technology for Digital Libraries
Hi-index | 0.00 |
In this paper we examine the issue of robust transaction routing in a locally distributed database environment where transaction characteristics such as reference locality imply that certain processing systems can be identified as being more suitable than others for a given transaction class. A response time based routing strategy can strike a balance between indiscriminate sharing of the load and routing based only on transaction affinity. Since response time estimates depend on workload and system parameters that may not be readily available, it is important to examine the robustness of routing decisions to information accuracy. We find that a strategy which strictly tries to minimize the response time of incoming transactions is sensitive to the accuracy of certain parameter values. On the other hand, naive strategies, that simply ignore the parameters in making routing decisions, have even worse performance. Three alternative strategies are therefore examined: threshold, discriminatory, and adaptive. Instead of just optimizing an incoming transaction's response time, the first two strategies pursue a strategy that is somewhat more oriented towards global optimization. This is achieved by being more restrictive on either the condition or the candidate for balancing the load. The third strategy, while trying to minimize the response time of individual incoming transactions, employs a feedback process to adaptively adjust future response time estimates. It monitors the discrepancy between the actual and estimated response times and introduces a correction factor based on regression analysis. All three strategies are shown to be robust with respect to the accuracy of workload and system parameters used in the response time estimation.