The Operational Analysis of Queueing Network Models

ACM Computing Surveys (CSUR)

Volumn 10, Issue 3, 1978, Pages 225-261

  Denning, Peter J ^a   Buzen, Jeffrey P ^b  

^a PURDUE UNIVERSITY   (United States)

^b BGS Systems Inc ^*  (United States)

Author keywords

balanced system; bottlenecks; decomposability; operational analysis; performance evaluation; performance modeling; queuelng models; queuelng networks; response tunes; saturation

Indexed keywords

QUEUEING NETWORKS;

COMPUTER SYSTEMS, DIGITAL;

EID: 0018012356     PISSN: 03600300     EISSN: 15577341     Source Type: Journal    
DOI: 10.1145/356733.356735     Document Type: Article

References (62)

1. Balbo, G.; Bruell, S. C.; and Schwetman, H. D. “Customer classes and closed network models—a solution technique,” in Proc. IFIP Congress 77, North-Holland Publ. Co., Amsterdam, The Netherlands, pp. 559-564.
2. Balbo, G.; and Denning, P. J. Approximating had distributions m time sharing systems, Tech. Rep. CSD-TR-259, Computer Science Dept., Purdue Univ., W. Lafayette, Ind., March 1978.
3. Baskett, F.; Chandy, K. M.; Muntz, R. R.; and Palacios, J. “Open, closed, and mixed networks with different classes of customers,” J. ACM 22, 2 (April 1975), 248-260.
4. Bouhana, J. “Operational aspects of centralized queueing networks,” PhD Thesis, Computer Science Dept., Univ. Wisconsin, Madison, Jan. 1978.
5. Brandwajn, A. “A model of a time sharing system solved using equivalence and decomposition methods,” Acta Inf. 4, 1 (1974), 11-47.
6. Brandwajn, A.; and Mouniex, B. “A Study of a Page-on-Demand System,” Inf Process. Lett. 6, 4 (Aug. 1977), 125-132.
7. Brown, R. M.; Browne, J. C.; and Chandy, K. M. “Memory management and response time,” Commun. ACM 20, 3 (March 1977), 153-165.
8. Browne, J. C.; Chandy, K. M.; Brown, R. M.; Keller, T. W.; Towsley, D. F.; and Dissly, C. W. “Hierarchical techniques for the development of realistic models of complex computer systems,” Proc. IEEE 63, 6 (June 1975), 966-976.
9. Buzen, J. P. “Analysis of system bottlenecks using a queueing network model,” in Proc. ACM SIGOPS Work-shop System Performance Evaluation, 1971, ACM, New York, pp. 82-103.
10. Buzen, J. P. “Queueing network models of multiprogramming,” PhD Thesis, Div. Eng. and Applied Physics, Harvard Univ., Cambridge, Mass., May 1971.
11. Buzen, J. P. “Optimizing the degree of multiprogramming in demand paging systems,” in Proc. IEEE COMPCON, 1971, IEEE, New York, pp. 139-140.
12. Buzen, J. P. “Computational algorithms for closed queueing networks with exponential servers,” Commun. ACM 16, 9 (Sept. 1973), 527-531.
13. Buzen, J. P. “Cost effective analytic tools for computer performance evaluation,” in Proc. IEEE COMPCON, 1975, IEEE, New York, pp. 293-296.
14. Buzen, J. P. “Operational analysis: the key to the new generation of performance prediction tools,” in Proc. IEEE COMPCON, 1976, IEEE, New York.
15. Buzen, J. P. “Fundamental operational laws of computer system perform- DENN77b ance,” Acta Inf. 7, 2 (1976), 167-182.
16. Buzen, J. P. “Principles of computer performance modeling and prediction,” in Infotech state of the art report on performance modeling and prediction, Infotech Int. Ltd., Maidenhead, UK, 1977, PP. 3-18.
17. Buzen, J. P. “Operational analysis: an alternative to stochastic modeling,” in Proc. Int. Conf Performance Computer Installations, 1978, North-Holland Publ. Co., Amsterdam, The Netherlands, pp. 175-194.
18. Buzen, J. P., et al. “BEST/1—design of a tool for computer system capacity planning,” in Proc. 1978 AFIPS Na tional Computer Conf., Vol. 47, AFIPS Press, Montvale, N.J., pp. 447-455.
19. Chandy, K. M., Herzog, U.; and Woo, L. “Parametric analysis of queueing networks,” IBM J. Res. Dev. 19, 1 (Jan. 1975), 36-42.
20. Chandy, K. M.; Herzog, U.; and Woo, L. “Approximate analysis of general queueing networks,” IBM J Res Dev. 19, 1 (Jan. 1975), 43-49.
21. Chandy, K. M.; and Sauer, C. H. “Approximate methods for analyzing queueing network models of computer systems,” Comput. Surv. 10, 3 (Sept. 1978), 281-317
22. Chang, A.; and Lavenberg, S. “Work rates in closed queueing networks with general independent servers” Oper. Res. 22, 4 (1974), 838-847.
23. Chow, W. The cycle time distribution of exponential central server queues, IBM Res. Rep. RC 6765, 1977.
24. Coffman, E G Jr., and Denning, P. J. Operating systems theory, Prentice-Hall, Englewood Cliffs, N.J., 1973. IGLE78
25. Courtois, P. J. “Decomposability, instabilities, and saturation in multiprogrammed systems,” Commun. ACM 18, 7 (July 1975), 371-377.
26. Courtois, P. J. Decomposability. queueing and computer system applications, Academic Press, New York, 1977.
27. Denning, P. J. “A note on paging drum efficiency,” Comput. Surv. 4, 1 (March 1972), 1-3.
28. Denning, P. J.; and Kahn, K. C. Some distribution-free properties of through-put and response time, Tech. Rep. CSD-TR-159, Computer Science Dept., Purdue Univ., W. Lafayette, Ind., May 1975.
29. Denning, P. J.; and Graham, G S. “Multiprogrammed memory management,”Proc IEEE 63, 6 (June 1975), 924-939.
30. Denning, P. J.; Kahn, K. C.; Lerou-Dier, J Potier, D., and Suri, R “Optimal multiprogramming,” Acta Inf. 7, 2 (1976), 197-216.
31. Denning, P. J.; and Buzen, J. P. “Operational analysis of queueing networks,” in Proc. Third Int. Symp. Computer Performance Modeling, Measurement, and Evaluation, 1977, North-Holland Publ. Co., Amsterdam, The Netherlands.
32. Denning, P J.; and Buzen, J. P. “An operational overview of queueing networks,” in Infotech state of the art report on performance modeling and prediction, Infotech Int. Ltd., Maidenhead, UK, 1977, pp. 75-108.
33. Denning, P. J. “Optimal multiprogrammed memory management,” in Current trends m programming methodology III, K. M. Chandy and R. Yeh (Eds.), Prentice-Hall, Englewood Cliffs, N.J., 1978, pp. 298-322.
34. Gardner, M. “Mathematical games: On the fabric of inductive logic, and some probability paradoxes,” Sci. Am 234, 3 (March 1976), 119-122.
35. Gelenbe, E.; and Muntz, R. R. “Probability models of computer systems I. exact results,” Acta Inf. 7, 1 (May 1976), 35-60.
36. Gelenbe, E., and Pujolle, G. “The behavior of a single queue in a general queueing network,” Acta Inf. 7, 2 (1976), 123-136.
37. Giammo, T. “Validation of a computer performance model of the exponential queueing network family,” Acta Inf. 7, 2 (1976), 137-152.
38. Gordon, W. J.; and Newell, G. F. “Closed queueing systems with exponential servers,” Oper. Res. 15 (1967), 254-265.
39. Herzog, U.; Woo, L.; and Chandy, K. M. “Solution of queueing problems by a recursive technique,” IBMJ. Res. Dev. 19, 3 (May 1975), 295-300.
40. Hughes, P. H.; and Moe, G. “A structural approach to computer performance analysis,” in Proc 1973 AFIPS National Computer Conf, Vol. 42, AFIPS Press, Montvale, N.J., pp. 109-119.
41. Iglehart, D. L. “The regenerative method for simulation analysis,” in Current trends in programming methodology III, K. M. Chandy and R. Yeh (Eds.), Prentice-Hall Englewood, Cliffs, N.J., 1978, pp. 52-71.
42. Jackson, J. R. “Networks of waiting lines,” Oper. Res. 5 (1957), 518-521.
43. Jackson, J. R. “Jobshop like queueing systems,” Manage. Sci. 10 (1963), 131-142.
44. Kleinrock, L. “Certain analytic results for time shared processors,” in Proc. IFIP Congress 1968, North-Holland Publ. Co., Amsterdam, The Netherlands, pp. 838-845.
45. Kleinrock, L. Queueing systems I, John Wdey, New York, 1975.
46. Kleinrock, L. Queueing systems II, John Wiley, New York, 1976.
47. Lazowska, E. D. “The use of percentiles in modeling CPU service time distributions,” in Proc. Int. Symp. Computer Performance Modeling, Measurement, and Evaluation, 1977, North-Hol-land Publ. Co., Amsterdam, The Netherlands, pp. 53-66.
48. Lazowska, E. D. “Characterizing service time and response time distributions in queueing network models of computer systems,” PhD Thesis, Univ. Toronto, Toronto, Ont., Canada. (Computer Systems Research Group, Tech. Rep. CSRG-85, Oct. 1977.)
49. Lipsky, L.; and Church, J. D. “Applications of a queueing network model for a computer system,” Comput. Surv. 9, 3 (Sept. 1977), 205-222.
50. Moore, C. G., III Network models for large-scale time sharing systems, Tech. Rep. 71-1, Dept. Industrial Eng., Univ. Michigan, Ann Arbor, April 1971, PhD Thesis.
51. Muntz, R. R.; and Wong, J. W. “Asymptotic properties of closed queueing network models,” in Proc. 8th Princeton Conf. Information Sciences and Systems, 1974, Dept. EECS, Prince ton Univ., Princeton, N.J., pp. 348-352.
52. Muntz, R. R. “Analytic modeling of interactive systems,” Proc IEEE 63, 6 (June 1975), 946-953.
53. Reiser, M.; and Kobayshi, H. “Queueing networks with multiple closed chains: theory and computation algorithms,” IBM J. Res. Dev. 19 (May 1975), 283-294.
54. Reiser, M.; and Sauer, C. H. “Queueing network models: methods of solution and their program implementations,” in Current trends in programming methodology III, K. M. Chandy WONG77 and R. Yeh (Eds.), Prentice-Hall, Englewood Cliffs, N.J., 1978, pp. 115-167.
55. Rose, C. A. “Measurement procedure for queueing network models of computer systems,” Comput Surv. 10, 3 (Sept. 1978), 263-280.
56. Scherr, A. L. An analysis of time shared computer systems, MIT Press, Cambridge, Mass., 1967.
57. Schwetman, H. D. “Hybrid simulation models of computer systems,” Commun. ACM 21 (1978), to appear.
58. Sevcik, K.; Levy, A. I., Tripathi, S. K.; and Zahorjan, J. L. “Improving approximations of aggregated queueing network subsystems,” in Proc. Int. Symp. Computer Performance Modeling, Measurement, and Evaluation, 1977, North-Holland Publ. Co., Amsterdam, The Netherlands, pp. 1-22.
59. Shum, A. W. C. “Queueing models for computer systems with general service time distributions,” PhD Thesis, Div. Eng. and Applied Physics, Harvard Univ., Cambridge, Mass., Dec. 1976.
60. Shum, A.W.C.; and Buzen, J. P. “The EPF technique: a method for obtaining approximate solutions to closed queueing networks with general service times,” in Proc. Int. Symp. Computer Performance Modeling, Measurement, and Evaluation, 1977, North-Holland Publ. Co., Amsterdam, The Netherlands, pp. 201-222.
61. Williams, A. C.; and Bhandiwad, R. A. “A generating function approach to queueing network analysis of multiprogrammed computers,” Networks 6, 1 (1976), 1-22.
62. Wong, J. W. “Distribution of end-to-end delay in message-switched networks,” Comput. Networks 2, 1 (Feb. 1978), 44-49.