S. Balsamo - 110 - Bibliografia
[ALL 94] Allen A.O. “Introduction to Computer Performance Analysis with Mathematica”, Academic Press, 1994.
[BD 93] Baynat, B. and Y. Dallery “A unified view of product-form approximation techniques for general closed queueing networks”Perf. Eval. 18, 205 - 224, 1993.
[BCM 75] Baskett, F., M.K.Chandy, R.R. Muntz, and F.G. Palacios “Open, closed and mixed networks of queues with different classes of customers” J. ACM 22, 2, 248 - 260, 1975.
[BUC 94] Buchholz P., “A Class of hierarchical queueing networks and their analysis” QUESTA 15, (1994) 59-80.
[BUZ 73] Buzen J.P. “Computational algorithm for closed queueing networks with exponential servers” C. ACM 16, 527 - 531, 1973.
[BI 82] Balsamo S. and G. Iazeolla “An extension of Norton’s theorem for queueing networks” IEEE Transactions on Software Engineering SE-8, 4, 298 - 305, 1982.
[CHW 75] Chandy, K.M., U. Herzog and L. Woo “Parametric analysis of queueing networks” IBM Journal of Research and Development 1, (1975), 36 - 42.
[CS 78] Chandy K.M. and C.H. Sauer“Approximate methods for analysis of queueing network models of computer systems” ACM Comp. Surv.
10, 263 - 280, 1978.
[CON 89] Conway A. E. and N. D. Georganas “Queueing Network- Exact Computational Algorithms: A Unified theory based on Decomposition and Aggregation” MIT Press, 1989.
[CSL 89] Conway A. E. , De Souza e Silva E. and Lavenberg S.S. “Mean value analysis by chain of product form queueing networks” IEEE Trans on Comp, 38, 3, 432 - 442, 1989.
[COU 77] Courtois P.J. “Decomposability” Academic Press, 1977.
[CS 84] Courtois P.J. and P. Semal “Bounds for the positive eigenvectors of nonnegative matrices and for their approximation by decomposition” J. ACM 31, 4, 804 - 825, 1984.
[DSL 89] De Souza e Silva E. and Lavenberg S.S. “Calculating joint queue length distributions in product form queueing networks”, J. ACM, 36, 1, 194 - 207, 1989.
[DL 93] L.Dowdy and C. Lowery “Performance Supplemet to Operating Systems”, Prentice-Hall, 1993.
S. Balsamo - 111 -
[FEL 66] Feller W. “An introduction to Probability Theory and its Applications”, Wiley, Vol.1 and 2, 1966.
[FER 78] Ferrari D. “Computer Systems Performance Evaluation”, Prentice- Hall, 1978.
[FSZ 81] Ferrari D., G. Serazzi, J. Ziegner “Measurement and Tuning of Computer Systems”, Prentice-Hall, 1983.
[FIS 78] Fishman G. S. “Principles of discrete event simulation”, Wiley, 1978.
[GEL 89] Gelenbe E. “Multiprocessor Performance”, Wiley, 1989.
[GN 67] Gordon W.J., G.F. Newell “Cycling Queuing Systems with Restricted legth Queues”, Oper. Res., 15, 1967.
[JAC 63] Jackson J.R. “Jobshop-like queueing systems”, Mgmt. Sci., 10,1963.
[JAI 90] Jain, R. “The art of computer systems performance analysis” John Wiley, New York, 1990.
[KAN 92] Kant K. “Introduction to Computer System Performance Evaluation” McGraw Hill, Int. Editions, 1992.
[KEL 79] Kell F.P. “Reversibility and Stochastic Networks” Wiley, NY, 1979.
[KIN 90] King P. J. “Computer and Communication System Performance Modelling”, Prentice-Hall, 1990.
[KLE 75] Kleinrock L. “Queueing Systems”, Vol 1, Wiley, New York, 1975 (Trad. italiana :“Sistemi a Coda”, Hoepli, 1990).
[KOB 78] Kobayashi H. “Modeling and Analysis: an Introduction to System Performance Evaluation Methodology” Addison-Wesley, Reading, MA, 1978.
[IAZ 78] Iazeolla G. “Introduzione alla simulazione discreta” Boringhieri, 1978.
[LL 83] Lam S.S. and Y.L. Lien “A tree convolution algorithm for the solution of queueing networks” C. ACM, 26, 3, 203 - 215, 1983.
[LAV 83] Lavenberg S.S. “Computer Performance Modeling Handbook”, Academic Press, New York, 1983.
[LAV 89] Lavenberg S.S. “A perspective on queueing models of computer performance” Perf. Eval. 10, 53 - 76, 1989.
[LK 82] Law A.M., W.D. Kelton “Simulation Modeling and Analysis”
MacGraw-Hill, 1982.
[LZG 84] Lazowska E.D., J. Zahorjan, G.S. Graham, K.C. Sevcick
“Quantitative System Performance; Computer System Analysis Using Queueing Network Models” Prentice-Hall, 1984.
S. Balsamo - 112 -
[MAR 79] Marie R.A., An approximate analytical method for general queueing networks, IEEE Transaction on Software Engineering SE-5, 5, 530 - 538, 1979.
[MBC 86] Ajmone Marsan M., G.Balbo, G.Conte “Peformance Models of Multiprocessor Systems”, MIT Press, MA, 1986.
[MIR 94] Mirandola R. “I modelli gerarchici per la valutazione delle prestazioni di sistemi di elaborazione e di comunicazione” Ph.D.
Thesis, University of Rome at Tor Vergata, 1994.
[PAW 90] Pawlikowski K. “Steady state simulation of queueing processes: A survey of problems and solutions” ACM Comp. Surv., 22, 2, 123- 170, 1990.
[RL 80] Reiser M.and S.S. Lavenberg “Mean value analysis of closed multichain queueing networks” Journal of the ACM, 27, 313 - 322, 1980.
[REI 81] Reiser M. “Mean value analysis and convolution method for queue dependent servers in closed queueing networks”, Perf. Eval. , 1 (1).
7-18, 1981.
[SC 79] Sauer C. and K.M. Chandy “Computer System Performance Modeling”, Prentice-Hall, 1979.
[SCH 87] Schwartz M. “Telecommunication Networks : Protocols, Modeling and Analysis” Addison-Wesley, 1987.
[SM 81] Sevcick K.and I. Mitrani “The Distribution of Queuing Network States at Input and Output Instants”, Journal of the ACM, 28, 358- 371, 1981.
[STE 83] Stewart G.W. “Computable error bounds for aggregated Markov chains” J. ACM 30, 2 , 271 - 285, 1983.
[TRI 82] Trivedi K. S. “Probability and Statistic with Reliability, Queuing and Computer Science Applications”, Prentice-Hall, Englewood Cliffs 1982.
[TS 85] Tucci S.and C.H. Sauer “The tree MVA algorithm” Perf. Eval., 5, 3, 1985.
