skip to main content
10.1145/1071021.1071041acmconferencesArticle/Chapter ViewAbstractPublication PagesicpeConference Proceedingsconference-collections
Article

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

Published:12 July 2005Publication History

ABSTRACT

Quality of service requirements are normally given in terms of soft deadlines, such as "90% of responses should complete within one second". To estimate the probability of meeting the target delay, one must estimate the distribution of response time, or at least its tail. Exact analytic methods based on state-space analysis suffer from state explosion, and simulation, which is also feasible, is very time consuming. Rapid approximate estimation would be valuable, especially for those cases which do not demand great precision, and which require the exploration of many alternative models.This work adapts layered queueing analysis, which is highly scalable and provides variance estimates as well as mean values, to estimate soft deadline success rates. It evaluates the use of an approximate Gamma distribution fitted to the mean and variance, and its application to examples of software systems. The evaluation finds that, for a definable set of situations, the tail probabilities over 90% are estimated well within a margin of 1% accuracy, which is useful for practical purposes.

References

  1. S. W. M. AuYeung, N. J. Dingle, and W. J. Knottenbelt, "Efficient Approximation of Response Time Densities and Quantiles in Stochastic Models," in Fourth Int. Workshop on Software and Performance (WOSP 04), Redwood City, CA, Jan. 2004, pp. 151--155. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. S. G. G. Bolch, H. de Meer, K. S. Trivedi, Queueing Networks and Markov Chains. John Wiley and Sons, 1998 Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. J.T. Bradley, N. J. Dingle, P. G. Harrison, and W. J. Knottenbelt, "Distributed Computation of Transient State Distributions and Passage Time Quantiles in Large Semi-Markov Models", Future Generation Computer Systems, 2004 Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. N. J. Dingle, P. G. Harrison, and W. J. Knottenbelt, Response Time Densities in Generalised Stochastic Petri Net Models, in 3rd Int. Workshop on Software and Performance (WOSP 2002), Rome, July, 2002, pp. 46--54 Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. G. Franks, Performance Analysis of Distributed Server Systems, PhD, Dept. of Systems and Computer Engineering, Carleton, Ottawa, Canada, 2000 Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. G. Franks, S. Majumdar, J. Neilson, D. Petriu, J. Rolia, and M. Woodside, "Performance Analysis of Distributed Server Systems", Proc. Sixth International Conference on Software Quality (6ICSQ), Ottawa, Ontario, 1996, pp. 15--26.Google ScholarGoogle Scholar
  7. H. Gautama and A. J. C. van Gemund, "Static Performance Prediction of Data-Dependent Programs," in Proceedings of the Second International Workshop on Software and Performance (WOSP2000), Ottawa, Canada, September 17-20, 2000, pp. 216--226. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. H. Gautama and A. J. C. v. Gemund, "Symbolic Performance Prediction of Speculative Parallel Programs," Parallel Processing Letters, vol. 13, no. 4 pp. 513--524, Dec 2003.Google ScholarGoogle ScholarCross RefCross Ref
  9. P. G. Harrison, "The Distribution of Cycle Times in Tree-Like Networks of Queues," Computer Journal, vol. 27, no. 1 pp. 27--36.Google ScholarGoogle ScholarCross RefCross Ref
  10. R. Jain, The Art of Computer Systems Performance Analysis. John Wiley & Sons Inc., 1991Google ScholarGoogle Scholar
  11. Z. Karian and E. Dudewicz, Fitting Statistical Distributions: The Generalized Lambda Distribution and Generalized Bootstrap Methods. CRC Press, Boca Raton, 2000.Google ScholarGoogle ScholarCross RefCross Ref
  12. V. Mainkar, K. S. Trivedi, S. Woolet, "Fast Approximate Computation of Response Time Distribution in Open Markovian Network of Queues", 7th Int. Conf. on Modelling Techniques and Tools for Computer Performance Evaluation, May 3-6, 1994 Vienna, AustriaGoogle ScholarGoogle Scholar
  13. J. McKenna, "Asymptotic expansion of the sojourn time distribution functions of jobs in closed product-form queueing networks," J. of ACM, vol. 34, pp. 985--1003, 1987 Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. J. Muppala, K. S. Trivedi, V. Mainkar, and V. Kulkarni, "Numerical Computation of Response Time Distributions Using Stochastic Reward Nets," Annals of Operations Research, vol. 48, pp. 155--184, 1994.Google ScholarGoogle ScholarCross RefCross Ref
  15. K. Raatikainen, "Approximating Response Time Distributions," in Proc. ACM Sigmetrics 89, Berkeley, CA, 1989, pp. 190--199. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Rolia, J. R., Sevcik, K. The method of layers. IEEE Transactions on Software Engineering, Vol. 21, No. 8, pp. 689--700, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. S. Salza, S. S. Lavenberg, "Approximating Response Time Distributions in Closed Queueing Network Models of Computer Performance", Proc. Performance '81, F. J. Kylstra (ed), North-Holland Publishing Company, 1981Google ScholarGoogle Scholar
  18. P. Tregunno, Practical Analysis of Software Bottlenecks, M.A.Sc thesis, Dept. of Systems and Computer Engineering, Carleton University, May 2003.Google ScholarGoogle Scholar
  19. Wong, J. W., "Distribution of End-to-End Delay in Message-Switched Networks," Computer Networks, Vol. 2, 1978.Google ScholarGoogle Scholar
  20. Woodside, C. M. "Throughput calculation for basic stochastic rendezvous networks". Performance Evaluation, Vol. 9, No. 2, pp. 143--160, 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. T. Zheng and M. Woodside, "Heuristic Optimization of Scheduling and Allocation for Distributed Systems with Soft Deadlines," in Proc. 13th Int. Conf. on Modelling Techniques and Tools for Computer Performance Evaluation (TOOLS 03), Urbana, USA, Sept. 2003Google ScholarGoogle ScholarCross RefCross Ref

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in
  • Published in

    cover image ACM Conferences
    WOSP '05: Proceedings of the 5th international workshop on Software and performance
    July 2005
    261 pages
    ISBN:1595930876
    DOI:10.1145/1071021

    Copyright © 2005 ACM

    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 12 July 2005

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • Article

    Acceptance Rates

    Overall Acceptance Rate149of241submissions,62%

    Upcoming Conference

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader