Approximating response time distributions

Authors:
K. E. E. Raatikainen
Affiliations:
University of Helsinki, Dept. of Computer Science, Teollisuuskatu 23-25, SF-00510 Helsinki, Finland
Venue:
SIGMETRICS '89 Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Year:
1989

Citing 6
Cited 1

Asymptotic expansions of the sojourn time distribution functions of jobs in closed, product-form queuing networks

Journal of the ACM (JACM)
Response time distribution in a multiprogrammed computer with terminal traffic

Performance Evaluation
Numerical Inversion of Laplace Transforms Using a Fourier Series Approximation

Journal of the ACM (JACM)
A spectral method for confidence interval generation and run length control in simulations

Communications of the ACM - Special issue on simulation modeling and statistical computing
The Distribution of Sojourn Times in a Queueing Network with Overtaking: Reduction to a Boundary Problem

Performance '83 Proceedings of the 9th International Symposium on Computer Performance Modelling, Measurement and Evaluation
Theory, Volume 1, Queueing Systems

Theory, Volume 1, Queueing Systems

Fast estimation of probabilities of soft deadline misses in layered software performance models

Proceedings of the 5th international workshop on Software and performance

Quantified Score

Hi-index	0.00

Visualization

Abstract

The response time is the most visible performance index to users of computer systems. End-users see individual response times, not the average. Therefore the distribution of response times is important in performance evaluation and capacity planning studies. However, the analytic results cannot be obtained in practical cases. A new method is proposed to approximate the response-time distribution. Unlike the previous methods the proposed one takes into account the service-time distributions and routing behaviour. The reported results indicate that the method provides reasonable approximations in many cases.