Optimal static load balancing in distributed computer systems
Journal of the ACM (JACM)
On multisystem coupling through function request shipping
IEEE Transactions on Software Engineering
A comparison of receiver-initiated and sender-initiated adaptive load sharing (extended abstract)
SIGMETRICS '85 Proceedings of the 1985 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
Mean-Value Analysis of Closed Multichain Queuing Networks
Journal of the ACM (JACM)
Linearizer: a heuristic algorithm for queueing network models of computing systems
Communications of the ACM
A model of shared DASD and multipathing
Communications of the ACM
Load Sharing in Distributed Real-Time Systems with State-Change Broadcasts
IEEE Transactions on Computers
On robust transaction routing and load sharing
ACM Transactions on Database Systems (TODS)
A Performance Study of Robust Distributed Load Sharing Strategies
IEEE Transactions on Parallel and Distributed Systems
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Performance Analysis of Database Systems
Performance Evaluation: Origins and Directions
Database system performance evaluation models: A survey
Performance Evaluation
| Hi-index | 0.01 |
The authors investigate dynamic transaction routing strategies for locally distributed database systems in which the database is partitioned and distributed among multiple transaction-processing systems, and the incoming transactions are routed by a common front-end processor. If a transaction issues a database request referencing a nonlocal database partition, the request has to be shipped to the system owing the referenced partition for processing. Various dynamic strategies are studied. Their performance is compared with that of the optimal static strategy. A class of dynamic transaction routing strategies which take into account routing history and minimize the estimated response time of incoming transactions is proposed; they are found to provide a substantial improvement over the optimal static strategy. The robustness of the strategies is further studied through sensitivity analysis over various transaction loads, communication overheads, and database reference distributions.