2002Unpublished venueRequires access

Satisfying response time goals in transaction processing

Donald Ferguson, Leonidas Georgiadis, Christos Nikolaou, K. Davies

Open publisher page 6 citations

Abstract

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.>

About this research paper

What this paper is about

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.>

Why it matters

OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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.>

Key concepts: Transaction processing system, Transaction processing, Online transaction processing, Database transaction, Computer science, Distributed transaction, Workload, Overhead (engineering)

Related papers

Back to paper searchBrowse research topicsOriginal source
Satisfying response time goals in transaction processing — Research Paper | ScholarLens