A Performance Study of Robust Distributed Load Sharing Strategies
IEEE Transactions on Parallel and Distributed Systems
Towards adaptive scheduling of tasks in transactional workflows
WSC '95 Proceedings of the 27th conference on Winter simulation
OLAP Query Routing and Physical Design in a Database Cluster
EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
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 |
This paper presents workload management algorithms for satisfying administration defined response time goals in transaction processing systems. Each arriving transaction belongs to a predefined. Transaction Class, and the system administrator defines an average response time goal for each transaction class. We present a dynamic transaction priority algorithm and a set of transaction routing algorithms for multiple processortransaction systems. These algorithms set priorities and route transactions based on the data objects accessed by the transactions, the current load of each system, and the goal satisfaction of the transaction classes. Our algorithms have low over-head and through a detailed simulation study we show that the algorithms substantially improve goal satisfaction compared to previous work.