Combining Queueing Networks and Generalized Stochastic Petri Nets for the Solution of Complex Models of System Behavior

IEEE Transactions on Computers

Volumn 37, Issue 10, 1988, Pages 1251-1268

  Balbo, Gianfranco ^a   Bruell, Steven C ^b   Ghanta, Subbarao ^c  

^a UNIVERSITY OF TURIN   (Italy)

^b UNIVERSITY OF IOWA   (United States)

^c UNIVERSITY OF MINNESOTA   (United States)

Author keywords

Concurrent tasks; fork; generalized stochastic; join; Petri nets; queueing networks; simultaneous resource possession

Indexed keywords

MATHEMATICAL TECHNIQUES -- GRAPH THEORY; PROBABILITY -- QUEUEING THEORY;

CONCURRENT TASKS; GENERALIZED STOCHASTIC PETRI NETS; QUEUEING NETWORKS;

COMPUTER SYSTEMS, DIGITAL;

EID: 0024091438     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.5986     Document Type: Article

References (41)

1. S. C. Agrawal and J. P. Buzen, “The aggregate server method for analyzing serialization delays,” ACM Trans. Comput. Syst., vol. 1, pp. 116-143, 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. Ajmone-Marsan, G. Balbo, G. Conte, and F. Gregoretti, “Modeling bus contention and memory interference in a multiprocessor system,” IEEE Trans. Comput., vol. C-32, pp. 60–72, w 1983.
4. M. Ajmone-Marsan, G. Balbo, G. Ciardo, and G. Conte, “A software tool for the automatic analysis of generalized stochastic Petri net models,” in Proc. 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. 93–122, May 1984.
6. G. Balbo and S. C. Bruell, “Computational aspects of aggregation in multiple class queueing networks,” Perform. Eval., vol. 3, pp. 177–185, 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, pp. 248–260.
8. BEST/1 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 North-Holland, 1980.
10. S. C. Bruell, G. Balbo, S. Ghanta, and P. V. Afshari, “A mean value analysis based package for the solution of product-form queueing network models,” in Proc. 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, ” in Proc. 1983 ACM SIGMETRlCS Conf. Measurement Modeling of Comput. Syst., Aug. 1983, pp. 12–27.
12. J. P. Buzen, “Computational algorithms for closed queueing networks with exponential servers,” Commun. ACM, vol. 16, pp. 527–531, Sept. 1973.
13. K. M. Chandy, U. Herzog, and L. Woo, “Parametric analysis of queueing networks,” IBM J. Res. Develop., vol. 19, pp. 36–42, Jan. 1975.
14. —, “Approximate analysis of general queueing networks,” IBM J. Res. Develop., vol. 19, pp. 43–49, 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. 371–376, 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,” Comput. Surveys, vol. 10, pp. 225–261, Sept. 1978.
19. J. B. Dugan, K. S. Trivedi, R. M. Geist, and V. F. Nicola, “Extended stochastic Petri nets: Applications and analysis,” in Proc. Perform. 84, Dec. 1984, pp. 507–519.
20. W. Feller, An Introduction to Probability Theory and Its Applications: Vol. I 3rd 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. C-32, pp. 73–82, 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. 449–460, 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. 142–151, 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. 1982.
29. A. E. Krzesinski, M. Booyens, P. S. Kritzinger, P. Teunissen, and S. Van Wyk, “SNAP—An analytic multiclass queueing network analyzer,” in Proc. Int. Conf. Modelling Techniques Tools Perform. Anal., Paris, France, May 1984.
30. E. D. Lazowska, J. Zahorjan, G. S. Graham, and K. C. Sevcik, Quantitative System Performance. Englewood Cliffs, NJ: Prentice-Hall, 1984.
31. M. K. Molloy, “On the integration of delay and throughput measures in distributed processing models,” Ph.D. dissertation, Univ. California, Los Angeles, 1981.
32. S. Natkin, “Reseaux de Petri stochastiques,” Ph.D. dissertation, CNAM-PARIS, June 1980.
33. J. L. Peterson, “Petri nets,” ACM Comput. Surveys, vol. 9, pp. 223–252, Sept. 1977.
34. MAP Users Guide, Quantitative System Performance, 1983.
35. M. Reiser and S. S. Lavenberg, “Mean value analysis of closed multichain queueing networks,” J. ACM, vol. 27, pp. 313–322, Apr. 1980.
36. H. D. Schwetman, “Hybrid simulation models of computer systems,” Commun. ACM, vol. 21, pp. 718–723, 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. 28–33, Jan. 1980.
38. S. K. Tripathi, A. K. Agrawala, M. Abrams, K. K. Ramakrishnan, and M. Singhal, “STEP-1: A user friendly performance analysis tool,” in Proc. Int. Conf. Modelling Techniques Tools Perform. Anal., Paris, France, May 1984.
39. H. Vantilborgh, “Exact aggregation in exponential queueing networks,” J. ACM, vol. 25, pp. 620–629, Oct. 1978.
40. M. Veran and D. Potier, “QNAP 2: A portable environment for queueing networks modelling,” in Proc. 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.