Skip to main content
SpringerLink
Log in
Book cover

Performance Evaluation: Origins and Directions pp 355–376Cite as

Numerical Analysis Methods

  • Chapter
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1769))

Abstract

In the context of Performance Evaluation (PE), numerical analysis methods refer to those methods which work with a Markov chain representation of the system under evaluation and use techniques from the domain of numerical analysis to compute stationary and/or transient state probabilities or other measures of interest. As is evident from reading through this book, the use of mathematical models to analyze complex systems has a long history. With the advent of high powered workstations and cheap memory, these applications have greatly expanded. More and more frequently, however, the characteristics of the system to be modeled are such that analytical solutions do not exist or are unknown so that systems engineers turn to computing numerical solutions rather than analytical solutions.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Ajmone Marsan, G. Balba and G. Conte. A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems. ACM Trans. Comput. Systems, Vol. 2, No. 2, pp 93–122, 1994.

    Article  Google Scholar 

  2. S.C. Allmaier and G. Horton. Parallel shared-memory state-space exploration in stochastic modelling. Lecture Notes in Compuer Science, #1253. Springer 1997.

    Google Scholar 

  3. S. Berson, E. de Souza e Silva and R.R. Muntz. A methodology for the specification and generation of Markov models. Numerical Solution of Markov Chains, William J. Stewart, Ed., Marcel Dekker Inc., New York, pp. 11–36, 1991.

    Google Scholar 

  4. S. Berson and R.R. Muntz. Detecting block GI/M/1 and block M/G/1 matrices from model specifications. Computations with Markov Chains, W.J. Stewart, Ed., Kluwer International Publishers, Boston, pp. 1–19, 1995.

    Google Scholar 

  5. P. Buchholz. Equivalence relations for stochastic automata networks. Computations with Markov Chains, W.J. Stewart, Ed., Kluwer International Publishers, Boston, pp. 197–215, 1995.

    Google Scholar 

  6. P. Buchholz. An aggregation-disaggregation algorithm for stochastic automata networks. Prob. in the Eng and Inf. Sci., Vol. 11, pp. 229–254, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  7. S. Caselli, G. Conte and P. Marenzoni. Parallel state space exploration for GSPN models. Lecture Notes in Computer Science # 935. Proceedings of the 16th International Conference on the Application and Theory of Petri Nets. Springer Verlag, Turin, Italy, June 1995.

    Google Scholar 

  8. W-L. Cao and W.J. Stewart. Iterative aggregation/disaggregation techniques for nearly uncoupled Markov chains. Journal of the ACM, Vol 32, pp. 702–719, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  9. Advances in matrix-analytic methods for stochastic models, S.R. Chakravarthy and A.S. Alfa, Ed. Lecture Notes in Pure and Applied Mathematics, 1998.

    Google Scholar 

  10. G. Ciardo, J. Muppala and K.S. Trivedi. SPNP: stochastic Petri net package. In Proceedings of the Third International Workshop on Petri Nets and Performance Models, (PNPM89), Kyoto, Japan, 1989.

    Google Scholar 

  11. G. Ciardo and M. Tilgner. On the use of Kronecker operators for the solution of generalized stochastic Petri nets. ICASE Report 96-35, Hampton, VA, may 1996.

    Google Scholar 

  12. G. Ciardo and A.S. Miner. Storage alternatives for large structured state spaces. IEEE International Computer Performance and Dependability Symposium, R. Marie et al., eds., Springer Verlag, LNCS 1245, pp. 44–57, 1997.

    Google Scholar 

  13. P.J. Courtois. Decomposability. Academic Press, New York, 1977.

    MATH  Google Scholar 

  14. C. A. Clarotti. The Markov approach to calculating system reliability: Computational Problems. In A. Serra and R. E. Barlow, editors, International School of Physics “Enrico Fermi”, Varenna, Italy, pp. 54–66, Amsterdam, 1984. North-Holland Physics Publishing.

    Google Scholar 

  15. J.N. Daigle and D.M. Lucantoni. Queueing systems having phase-dependent arrival and service rates. Numerical Solution of Markov Chains, William J. Stewart, Ed., Marcel Dekker Inc., New York, pp. 161–202, 1991.

    Google Scholar 

  16. S. Donatelli. Superposed stochastic automata: A class of stochastic Petri nets with parallel solution and distributed state space. Performance Evaluation, Vol. 18, pp. 21–36, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  17. A.I. Elwalid, D. Mitra and T.E. Stern. Theory of statistical multiplexing of Markovian sources: Spectral expansions and algorithms. Numerical Solution of Markov Chains, William J. Stewart, Ed., Marcel Dekker Inc., New York, pp. 223–238, 1991.

    Google Scholar 

  18. P. Fernandes, B. Plateau and W.J. Stewart. Efficient descriptor-vector multiplication in stochastic automata networks. Journal of the ACM, Vol. 45, No. 3, May 1998.

    Google Scholar 

  19. J-M. Fourneau and F. Quessette. Graphs and stochastic automata networks. Computations with Markov Chains. W.J. Stewart, Ed., Kluwer International Publishers, Boston, 1995.

    Google Scholar 

  20. G. Franceschinis and R. Muntz. Computing bounds for the performance indices of quasi-lumpable stochastic well-formed nets. Proceedings of the 5th International Workshop on Petri Nets and Performance Models, Toulouse, France, IEEE Press, pp. 148–157, October 1993.

    Google Scholar 

  21. S.B. Gershwin, and I.C. Schick. Modelling and analysis of three-stage transfer lines with unreliable machines and finite buffers. Operations Research, 31,2, pp. 354–380, 1983.

    MATH  Google Scholar 

  22. G. H. Golub and C. F. Van Loan. Matrix Computations. The Johns Hopkins University Press, Baltimore, second edition, 1989.

    MATH  Google Scholar 

  23. W. Grassmann. Transient solutions in Markovian queueing systems. Comput. Opns. Res., 4:47–56, 1977.

    Article  Google Scholar 

  24. W. Grassmann, M.I. Taksar and D.P. Heyman. Regenerative analysis and steady state distributions, Operations Research, Vol. 33, pp 1107–1116, 1985.

    MATH  MathSciNet  Google Scholar 

  25. D. Gross and D. R. Miller. The randomization technique as modelling tool and solution procedure for transient Markov processes. Operations Research, 32(2):343–361, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  26. J. Hillston. Computational Markovian modelling using a process algebra. Computations with Markov Chains, W.J. Stewart, Ed., Kluwer International Publishers, Boston, 1995.

    Google Scholar 

  27. M.A. Jafari and J.G. Shanthikumar. Finite state spacially non-homogeneous quasi birth-death processes. Working Paper #85-009, Dept. of Industrial Engineering and Operations Research, Syracuse University, Syracuse, New York 13210.

    Google Scholar 

  28. P. Kemper. Closing the gap between classical and tensor based iteration techniques. Computations with Markov Chains, W.J. Stewart, Ed., Kluwer International Publishers, Boston, 1995.

    Google Scholar 

  29. R. Klevans and W.J. Stewart. From queueing networks to Markov chains: The XMarca interface. Performance Evaluation, Vol. 24, pp. 23–45, 1995.

    Article  MATH  Google Scholar 

  30. U. Krieger, B. Muller-Clostermann and M. Sczittnick. Modeling and analysis of communication systems based on computational methods for Markov chains. IEEE Journ. on Selec. Ar. in Comm, Vol. 8, pp. 1630–1648, 1990.

    Article  Google Scholar 

  31. W.J. Knottenbelt. Generalized Markovian analysis of timed transition systems. Master’s thesis, University of Capetown, 1995.

    Google Scholar 

  32. W.J. Knottenbelt, M. Mestern, P. Harrison and P. Kritzinger. Probability, parallelism and the state space exploration problem. Lecture Notes in Computer Science, #1469. R. Puigjaner, N.N. Savino and B. Serra, Eds. Springer Publishers, 1998.

    Google Scholar 

  33. G. Latouche and Y. Ramaswami. A logarithmic reduction algorithm for quasi birth and death processes. Technical Report, Bellcore TM-TSV-021374 and Université Libre de Bruxelles, Sémin. Théor. Prob., Rapp. Tech. 92/3, 1992.

    Google Scholar 

  34. S.Q. Li and J.W. Mark. Performance of voice/data integration on a TDM system. IEEE Trans. Communications, Vol. COM-33, No. 12, Dec. 1985, pp. 1265–1273.

    Article  Google Scholar 

  35. C. Lindemann. Exploiting isomorphisms and special structures in the analysis of Markov regenerative stochastic Petri nets. Computations with Markov Chains, W.J. Stewart, Ed., Kluwer International Publishers, Boston, pp. 383–402, 1995.

    Google Scholar 

  36. M. Malhotra and K. S. Trivedi. Higher-order methods for transient analysis of stiff Markov chains. Duke University Technical Report DUKE-CCSR-91, Center for Computer Systems Research, Durham, USA, 1991.

    Google Scholar 

  37. D.F. McAllister, G.W. Stewart and W.J. Stewart. On a Rayleigh-Ritz refinement technique for nearly uncoupled stochastic matrices. Journal of Linear Algebra and Its Applications, Vol. 60, pp. 1–25, August 1984.

    Article  MATH  MathSciNet  Google Scholar 

  38. C.D. Meyer. Stochastic complementation, uncoupling Markov chains and the theory of nearly reducible systems. SIAM Rev., Vol. 31, pp. 240–272, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  39. C. B. Moler and C. F. Van Loan. Nineteen dubious ways to compute the exponential of a matrix. SIAM Review., Vol. 20, No. 4, pp. 801–836, October 1978.

    Article  MATH  MathSciNet  Google Scholar 

  40. E.J. Muth and S. Yeralan. Effect of buffer size on productivity of work stations that are subject to breakdowns. The 20-th IEEE Conference on Decision and Control, pp. 643–648, 1981.

    Google Scholar 

  41. M.F. Neuts. Matrix geometric solutions in stochastic models — An algorithmic approach. Johns Hopkins University Press, Baltimore, (1981).

    MATH  Google Scholar 

  42. B. Philippe, Y. Saad, and W. J. Stewart. Numerical methods in Markov chains modeling. Operations Research, Vol. 40, No. 6, 1992.

    Google Scholar 

  43. B. Philippe and R. B. Sidje. Transient solutions of Markov processes by Krylov subspaces. Computations with Markov Chains, W.J. Stewart, Ed., Kluwer International Publishers, Boston, pp. 95–119, 1995.

    Google Scholar 

  44. B. Plateau. On the stochastic structure of parallelism and synchronization models for distributed algorithms. Proc. ACM Sigmetrics Conference on Measurement and Modelling of Computer Systems, Austin, Texas, August 1985.

    Google Scholar 

  45. B. Plateau and K. Atif. Stochastic automata network for modelling parallel systems. IEEE Trans. on Software Engineering, Vol. 17, No. 10, pp. 1093–1108, 1991.

    Article  MathSciNet  Google Scholar 

  46. B. Plateau, J.M. Fourneau and K.H. Lee. PEPS: A package for solving complex Markov models of parallel systems. In R. Puigjaner, D. Potier, Eds., Modelling Techniques and Tools for Computer Performance Evaluation, Spain, September 1988.

    Google Scholar 

  47. M. Veran and D. Potier. QNAP2: A portable environment for queueing systems modelling. In D. Potier, ed. Modelling and Tools for Performance Analysis, pp. 25–63. Elsevier Science Publishers, 1985.

    Google Scholar 

  48. V. Ramaswami. Nonlinear matrix equations in applied probability — Solution techniques and open problems. SIAM Review, Vol.30, No. 2, pp. 256–263, June 1988.

    Article  MATH  MathSciNet  Google Scholar 

  49. A. Reibman and K. Trivedi. Transient analysis of cumulative measures of Markov model behavior. Commu. Statist.-Stochastic Models, 5(4):683–710, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  50. Y. Saad. Iterative solution of sparse linear systems. PWS Publishing, New York, 1996.

    Google Scholar 

  51. Y. Saad. Numerical methods for large eigenvalue problems. John Wiley & Sons, Manchester Univ. Press, 1992.

    Google Scholar 

  52. P.J. Schweitzer. Aggregation methods for large Markov chains. In Mathematical Computer Performance and Reliability, G. Iazeolla, P.J. Courtois and A. Hordijk, Eds. North-Holland, Amsterdam, pp 275–286, 1984.

    Google Scholar 

  53. P. Semal. Two bounding schemes for the steady state solution of Markov chains. Computations with Markov Chains, W.J. Stewart, Ed., Kluwer International Publishers, Boston, pp. 307–320, 1995.

    Google Scholar 

  54. R. B. Sidje. Parallel algorithms for large sparse matrix exponentials: Application to numerical transient analysis of Markov processes. PhD thesis, University of Rennes 1, July 1994.

    Google Scholar 

  55. R. B. Sidje. Expokit. A software package for computing matrix exponentials. Accepted for publication in ACM-Transactions of Mathematical Software, 1997.

    Google Scholar 

  56. M. Squillante. MAGIC: A computer performance modeling tool based on matrix geometric techniques. Computer Performance Evaluation: Modeling Techniques and Tools, G. Balbo and G. Serazzi, Eds. North-Holland Publishers, pp. 411–425, 1992.

    Google Scholar 

  57. W.J. Stewart. An Introduction to the Numerical Solution of Markov Chains, Princeton University Press, New Jersey, 1994.

    Google Scholar 

  58. W.J. Stewart, K. Atif and B. Plateau. The numerical solution of stochastic automata networks. European Journal of Operations Research, Vol. 86, No. 3, pp. 503–525, 1995.

    Article  MATH  Google Scholar 

  59. W.J. Stewart. Marca: Markov chain analyzer. IEEE Computer Repository No. R76 232, 1976. (See the URL: http://www.csc.ncsu.edu/faculty/WStewart/)

  60. V.I. Wallace and R.S. Rosenberg. RQA-1, The recursive queue analyzer. Technical report No.2, Systems Engineering Laboratory, University of Michigan, Ann Arbor, Feb. 1966.

    Google Scholar 

  61. V. Wallace. The solution of quasi birth and death processes arising from multiple access computer systems. Ph.D. Dissertation, Systems Engineering Laboratory, University of Michigan, Tech. Report No. 07742-6-T, 1969.

    Google Scholar 

  62. Wong, Giffin, and Disney, Two finite M/M/1 queues in tandem: A matrix solution for the steady state. OPSEARCH 14,1, pp 1–18, 1977.

    MathSciNet  Google Scholar 

  63. T. Yang, M.J.M. Posner and J.G.C. Templeton. A generalized recursive technique for finite Markov processes. Numerical Solution of Markov Chains, William J. Stewart, Ed., Marcel Dekker Inc., New York, pp. 203–221, 1991.

    Google Scholar 

  64. J. Ye and S.Q. Li. Analysis of multi-media traffic queues with finite buffer and overload control — Part I: Algorithms. Proc. of INFOCOM’ 91, pp. 1464–1474.

    Google Scholar 

  65. J. Ye and S.Q. Li. Analysis of multi-media trafic queues with finite buffer and overload control — Part II: Applications. Proc. of INFOCOM’ 92, pp. 848–859.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, North Carolina State University, Raleigh, NC, 27695-8206

    William J. Stewart

Authors
  1. William J. Stewart
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Angewandte Informatik und Informationssysteme, Universität Wien, Lenaugasse 2/8, 1080, Wien, Austria

    Günter Haring

  2. Informatik IV, Universität Dortmund, August-Schmidt-Straße 12, 44227, Dortmund, Germany

    Christoph Lindemann

  3. GMD Institut für Medienkommunikation, Schloß Birlinghoven, Postfach 1316, 53754, Sankt Augustin, Germany

    Martin Reiser

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Stewart, W.J. (2000). Numerical Analysis Methods. In: Haring, G., Lindemann, C., Reiser, M. (eds) Performance Evaluation: Origins and Directions. Lecture Notes in Computer Science, vol 1769. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46506-5_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-46506-5_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67193-0

  • Online ISBN: 978-3-540-46506-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation