Satisfying response time goals in transaction processing systems

Abstract

This paper presents workload management algorithms for satishing 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 processor transaction systems. These algorithms set priorities and route transactions based on the data objects accessed by the transactions, the CUT-rent load of each system, and the goal satisfaction of the transaction classes. OUTalgorithms have low overhead and through a detailed simulation study we show that the algorithms substantially improve goal satisfaction compared to previous work.