This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Rational Approximants for Some Performance Analysis Problems
December 1995 (vol. 44 no. 12)
pp. 1394-1404
ASCII Text
x 
 
Hong Yang, Wei-Bo Gong, "Rational Approximants for Some Performance Analysis Problems," IEEE Transactions on Computers, vol. 44, no. 12, pp. 1394-1404, December, 1995.
 
 
BibTex
x
 
@article{ 10.1109/12.477245,
author = {Hong Yang and Wei-Bo Gong},
title = {Rational Approximants for Some Performance Analysis Problems},
journal ={IEEE Transactions on Computers},
volume = {44},
number = {12},
issn = {0018-9340},
year = {1995},
pages = {1394-1404},
doi = {http://doi.ieeecomputersociety.org/10.1109/12.477245},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - Rational Approximants for Some Performance Analysis Problems
IS - 12
SN - 0018-9340
SP1394
EP1404
EPD - 1394-1404
A1 - Hong Yang,
A1 - Wei-Bo Gong,
PY - 1995
KW - Performance analysis
KW - approximation techniques
KW - queueing networks
KW - multiprocessor systems
KW - Markov chains
KW - asymptotic analysis.
VL - 44
JA - IEEE Transactions on Computers
ER -
 

Abstract—Performance index functions with integer parameters are important in the evaluation and analysis of computer systems, communication networks and general distributed and parallel processing systems. These functions are often difficult to evaluate for large integers. On the other hand, most of these performance functions have nice properties such as monotonicity, convexity, analyticity, as well as obtainable asymptotic behavior. These properties make it possible to use rational approximants to extrapolate the performance functions. In this paper we present the rational approximants for several example systems. Our numerical results suggest that this approach could lead to a promising tool for many applications.

[1] G.A. Baker and P. Graves-Morris,PadéApproximants, Part I: Basic Theory.Reading, Mass: Addison-Wesley, 1981.
[2] G.A. Baker and P. Graves-Morris,PadéApproximants, Part II: Extensions and Applications.Reading, Mass: Addison-Wesley, 1981.
[3] D.J. Bertsimas and L.D. Servi,“Deducing queueing from transactional data: The queue inference engine, revised,” Operations Research, vol. 40, pp. 217-228, 1992.
[4] D. Braess,Nonlinear Approximation Theory. Springer-Verlag, 1986.
[5] C. Brezinski and M. Redivo Zaglia,Extrapolation Methods-Theory and Practice.New York: North-Holland, 1991.
[6] A.E. Conway and N.D. Georganas, Queueing Networks—Exact Computational Algorithms. MIT Press, 1989.
[7] D.J. Daley and L.D. Servi,“Approximating last exit probabilities of a random walk, with application to busy periods of M/GI/1 queues,” manuscript 1992.
[8] D. Gibson and E. Seneta,“Monotone infinite stochastic matrices and their augmented truncations,” Stochastic Proceedings Application, vol. 24, pp. 287-292, 1987.
[9] D. Gibson and E. Seneta,“Augmented truncations of infinite stochastic matrices,” J. Applied Probabilities, vol. 24, pp. 600-608, 1987.
[10] W.B. Gong,S. Nananukul,, and A. Yan,“Padéapproximation for stochastic discrete event systems,” IEEE Trans. Automatic Control, Aug. 1995.
[11] J.J. Gordon, “The evaluation of normalizing constants in closed queueing networks,” Operations Research, vol. 38, pp. 863-869, 1990.
[12] D.P. Heyman,“Approximating the stationary distribution of an infinite stochastic matrix,” J. Applied Probabilities., vol. 28, pp. 96-103, 1991.
[13] J. Karlsson,“Rational interpolation and best rational approximation,” J. Math. Anal. and Appl., vol. 53, pp. 38-52, 1976.
[14] R. Larson,“The queue inference engine: deducing queue statistics from transactional data,” Management Science, vol. 36, pp. 586-601, 1990.
[15] M. Ajmone Marsan, G. Balbo, and G. Conte, Performance Models of Multiprocessor Systems.Cambridge, Mass.: MIT Press, 1986.
[16] J. McKenna,D. Mitra,, and K.G. Ramakrishnan,“A class of closed Markovian queueing networks: Integral representations, asymptotic expansions, and generalizations,” Bell Systems Technical J., vol. 60, pp. 599-641, 1981.
[17] L.M. Milne-Thomson,The Calculus of Finite Differences.London: MacMillan., 1951.
[18] P.P. Petrushev, and V.A. Popov,Rational Approximation of Real Functions.London: Cambridge Univ. Press, 1987.
[19] E.B. Saff,R.S. Varga,, and W.C. Ni,“Geometric convergence of rational approximations to in infinite sectors,” Numerical Mathematics, vol. 26, pp. 211-225, 1976.
[20] A.F. Timan,Theory of Approximation of Functions of a Real Variable.New York: Macmillan, 1963.
[21] H. Werner,“A reliable method for rational interpolation,” PadéApproximation and its Applications, L. Wuytack, ed., pp. 257-277, Springer-Verlag, 1979.
[22] J.M. Whittaker,Interpolatory Function Theory.New York: Stechert-Hafner Service Agency, 1964.
[23] D. Wolf,“Approximation of the invariant probability measure of an infinite stochastic matrix,” Adv. Appl. Prob., vol. 12, pp. 710-726, 1980.
[24] L. Wuytack,“A new technique for rational extrapolation to the limit,” Numerical Mathematics., vol. 17, pp. 215-221, 1971.
[25] H. Yang and W.B. Gong,“On calculating the normalization constants in queueing networks,” Proc. 33rd CDC, pp. 2,075-2,076, 1994.

Index Terms:
Performance analysis, approximation techniques, queueing networks, multiprocessor systems, Markov chains, asymptotic analysis.
Citation:
Hong Yang, Wei-Bo Gong, "Rational Approximants for Some Performance Analysis Problems," IEEE Transactions on Computers, vol. 44, no. 12, pp. 1394-1404, Dec. 1995, doi:10.1109/12.477245
Usage of this product signifies your acceptance of the Terms of Use.