Satisfying response time goals in transaction processing

Workload management algorithms for satisfying administration defined response time goals in transaction processing systems are presented. Each arriving transaction belongs to a predefined transaction class, and the system administrator defines an average response time goal for each transaction class. A dynamic transaction priority algorithm and a set of transaction routing algorithms for multiple processor transaction systems are given. 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. The algorithms have low overhead, and a detailed simulation study shows that they substantially improve goal satisfaction compared to previous work