
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
G. Balbo, S.C. Bruell, S. Ghanta, "Combining Queueing Networks and Generalized Stochastic Petri Nets for the Solution of Complex Models of System Behavior," IEEE Transactions on Computers, vol. 37, no. 10, pp. 12511268, October, 1988.  
BibTex  x  
@article{ 10.1109/12.5986, author = {G. Balbo and S.C. Bruell and S. Ghanta}, title = {Combining Queueing Networks and Generalized Stochastic Petri Nets for the Solution of Complex Models of System Behavior}, journal ={IEEE Transactions on Computers}, volume = {37}, number = {10}, issn = {00189340}, year = {1988}, pages = {12511268}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.5986}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Combining Queueing Networks and Generalized Stochastic Petri Nets for the Solution of Complex Models of System Behavior IS  10 SN  00189340 SP1251 EP1268 EPD  12511268 A1  G. Balbo, A1  S.C. Bruell, A1  S. Ghanta, PY  1988 KW  queueing networks; generalized stochastic Petri nets; complex models; system behavior; Petri nets; queueing theory; stochastic processes. VL  37 JA  IEEE Transactions on Computers ER   
[1] S. C. Agrawal and J. P. Buzen, "The aggregate server method for analyzing serialization delays,"ACM Trans. Comput. Syst., vol. 1, pp. 116143, May 1983.
[2] S. C. Agrawal, "Metamodeling: A study of approximations in queueing models," Ph.D. dissertation, Dep. Comput. Sci., Purdue Univ., Aug. 1983.
[3] M. AjmoneMarsan, G. Balbo, G. Conte, and F. Gregoretti, "Modeling bus contention and memory interference in a multiprocessor system,"IEEE Trans. Comput., vol. C32, pp. 6072, Jan. 1983.
[4] M. AjmoneMarsan, G. Balbo, G. Ciardo, and G. Conte, "A software tool for the automatic analysis of generalized stochastic Petri net models," inProc. Int. Conf. Modelling Techniques Tools Perform. Anal., Paris, France, May 1984.
[5] M. Ajmone Marsan, G. Balbo, and G. Conte, "A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems,"ACM Trans. Comput. Syst., vol. 2, pp. 93122, May 1984.
[6] G. Balbo and S. C. Bruell, "Computational aspects of aggregation in multiple class queueing networks,"Perform. Eval., vol. 3, pp. 177185, 1983.
[7] F. Baskett, K. M. Chandy, R. R. Muntz, and F. G. Palacios, "Open, closed, and mixed networks of queues with different classes of customers,"J. ACM, vol. 22, no. 2, pp. 248260, 1975.
[8] BEST/I Users Guide, BGS Systems, Inc., 1982.
[9] S.C. Bruell and G. Balbo,Computational Algorithms for Closed Queueing Networks, Operating and Programming Systems Series, P. J. Denning, Ed. New York: Elsevier NorthHolland, 1980.
[10] S. C. Bruell, G. Balbo, S. Ghanta, and P. V. Afshari, "A mean value analysis based package for the solution of productform queueing network models," inProc. Int. Conf. Modeling Techniques Tools Perform. Anal., Paris, France, May 1984.
[11] R. M. Bryant, A. E. Krzesinski, and P. Teunissen, "The MVA preempt resume priority approximation," inProc. 1983 ACM SIGMETRICS Conf. Measurement Modeling of Comput. Syst., Aug. 1983, pp. 1227.
[12] J. P. Buzen, "Computational algorithms for closed queueing networks with exponential servers,"Commun. ACM, vol. 16, no. 9, Sept. 1973.
[13] K. M. Chandy, U. Herzog, and L. Woo, "Parametric analysis of queueing networks,"IBM J. Res. Develop., vol. 19, pp. 3642, Jan. 1975.
[14] K. M. Chandy, "Approximate analysis of general queueing networks,"IBM J. Res. Develop., vol. 19, pp. 4349, Jan. 1975.
[15] K. M. Chandy and M. S. Lakshmi, "An approximation technique for queueing networks with preemptive priority queues," Tech. Rep., Dep. Comput. Sci., Univ. Texas at Austin, 1983.
[16] P. J. Courtois, "Decomposability, instabilities, and saturation in multiprogramming systems,"Commun. ACM, vol. 18, pp. 371376, July 1975.
[17] P. J. Courtois,Decomposability: Queueing and Computer System Applications, New York: Academic, 1977.
[18] P. J. Denning and J. P. Buzen, "The operational analysis of queueing network models,"ACM Comput. Surveys, vol. 10, pp. 225261, Sept. 1978.
[19] J. B. Dugan, K. S. Trivedi, R. M. Geist, and V. F. Nicola, "Extended stochastic petri nets: Applications and analysis," inProc. 10th Int. Symp. Comput. Performance (PERFORMANCE 84), Dec. 1984, pp. 507520.
[20] W. Feller,An Introduction to Probability Theory and Its Applications: Vol. I3rd ed. New York: Wiley, 1968.
[21] G. S. Fishman,Concepts and Methods in Discrete Event Digital Simulation, New York: Wiley, 1973.
[22] S. Ghanta "On the integration of queueing networks and generalized stochastic Petri nets for the performance evaluation of computer systems," Ph.D. dissertation, Dep. Comput. Sci., Univ. Minnesota, Dec. 1984.
[23] P. Heidelberger and K. S. Trivedi, "Analytic queueing models for programs with internal concurrency,"IEEE Trans. Comput., vol. C32, pp. 7382, Jan. 1983.
[24] RESQ Users Guide, IBM Corp., 1982.
[25] D. L. Iglehart and G. S. Shedler, "Regenerative simulation of response times in networks of queues,"J. ACM., vol. 3, pp. 449460, July 1978.
[26] PAWS/A Users Guide, Information Research Associates, 1983.
[27] P. A. Jacobson and E. D. Lazowska, "Analyzing queueing networks with simultaneous resource possession,"Commun. ACM, vol. 25, pp. 142151, Feb. 1982.
[28] P. S. Kritzinger, S. V. Wyk, and A. E. Krzesinski, "A generalization of Norton's theorem for multiple class queueing networks,"Perform. Eval., vol. 2, pp. 98107, 1982.
[29] A. E. Krzesinski, M. Booyens, P. S. Kritzinger, P. Teunissen, and S. Van Wyk, "SNAPAn analytic multiclass queueing network analyzer," inProc. Int. Conf. Modelling Techniques Tools Perform. Annl., Paris, France, May 1984.
[30] E. D. Lazawskaet al., Quantitative System PerformanceComputer System Analysis Using Queueing Network Models. Englewood Cliffs, NJ: PrenticeHall, 1984.
[31] M. K. Molloy, "On the integration of delay and throughput measures in distributed processing models," Ph.D. dissertation, Dep. Comput. Sci., Univ. of California, Los Angles, 1981.
[32] S. Natkin, "Reseaux de Petri stochastiques," Ph.D. dissertation, CNAMPARIS, June 1980.
[33] J. L. Peterson, "Petri nets,"ACM Comput. Surveys, vol. 9, no. 3, pp. 223252, Sept. 1977.
[34] MAP Users Guide, Quantitative System Performance, 1983.
[35] M. Reiser and S. Lavenberg, "Mean value analysis of closed multichain queueing networks,"J. ACM, vol. 27, no. 2, Apr. 1980.
[36] H. D. Schwetman, "Hybrid simulation models of computer systems,"Commun. ACM, vol. 21, pp. 718723, Sept. 1978.
[37] F. J. Symons, "Introduction to numerical Petri nets, a general graphical model of concurrent processing systems,"A.T.R., vol. 14, pp. 2833, Jan. 1980.
[38] S. K. Tripathi, A. K. Agrawala, M. Abrams, K. K. Ramakrishnan, and M. Singhal, "STEP1: A user friendly performance analysis tool," inProc. Int. Conf. Modelling Techniques Tools Perform. Anal., Paris, France, May 1984.
[39] H. Vantilborgh, "Exact aggregation in exponential queueing networks,"J. ACM, vol. 25, no. 4, 1978.
[40] M. Veran and D. Potier, "QNAP 2: A portable environment for queueing networks modelling," inProc. Int. Conf. Modelling Techniques Tools Perform. Anal., Paris, France, May 1984.
[41] J. Zahorjan, "The approximate solution of large queueing network models," Ph.D. dissertation, Univ. Toronto, Aug. 1980.