Skip Navigation

The Computer Journal 1999 42(3):241-250; doi:10.1093/comjnl/42.3.241
© 1999 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (4)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Tomov, N.
Right arrow Articles by Burger, A.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Approximate Estimation of Transaction Response Time

Neven TomovA1, Euan DempsterA1, M. Howard WilliamsA1, Peter J. B. KingA1 and Albert BurgerA1

A1 Department of Computing and Electrical Engineering, Heriot-Watt University, Edinburgh, EH14 4AS, Scotland, UK Email: howard@cee.hw.ac.uk

This paper describes a study of different approximation techniques used to predict the response times of database transactions represented as patterns of resource consumption and modelled with non-product-form queueing networks. The techniques are applied to a range of examples. The experiments show that none of the approximation techniques has a consistent advantage over the others for all cases considered. On the other hand, a simple heuristic rule is formulated which provides an acceptable approximation to the average transaction response time for the entire range of examples. The rule specifies a procedure for labelling each queue in a queueing network as either an M/M/1 or an M/G/1 resource. The resulting network can then be solved to obtain the mean response time of individual transactions.

Received 14 September, 1998. Revised 19 March, 1999.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.