About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
International Conference on Parallel and Distributed Information Systems 1993
Conference paper
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.