Peter J. Denning
Jeffrey P. Buzen
- BALB77 BALBO, G.; BRUELL, S. C.; AND SCHWET- MAN, 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.Google Scholar
- BALB78 BALBO, G., AND DENNING, P. J. Approxtmating load distributions m time sharing systems, Tech. Rep. CSD- TR-259, Computer Science Dept., Purdue Univ., W. Lafayette, Ind., March 1978.Google Scholar
- BASK75 BASKETT, F.; CHANDY, K. M.; MUNTZ, R. R.; AND P ALACIOS, J. "Open, closed, and mixed networks with different classes of customers," J. A CM 22, 2 (April 1975), 248-260. Google Scholar
- BOUH78 BOUHANA, J. "Operational aspects of centralized queuemg networks," PhD Thesis, Computer Science Dept., Univ. Wisconsin, Madison, Jan. 1978. Google Scholar
- BRAN74 BRANDWAJN, A. "A model of a time sharing system solved using equivalence and decomposition methods," Acta Inf. 4, 1 (1974), 11-47.Google Scholar
- BRAN77 BRANDWAJN, A.; AND MOUNIEX, B. "A study of a page-on-demand system," Inf. Process. Lett. 6, 4 (Aug. 1977), 125-132.Google Scholar
- BROW77 BROWN, R. M.; BROWNE, J. C.; AND CHASVV, K. M. "Memory management and response time," Commun. ACM 20, 3 (March 1977), 153-165. Google Scholar
- BROW75 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.Google Scholar
- BUZE71a BuzEs, J.P. "Analyms of system bottlenecks using a queueing network model," in Proc. A CM SIGOPS Work. shop System Performance Evaluation, 1971, ACM, New York, pp. 82-103. Google Scholar
- BUZE71b BUzEN, J. P. "Queuemg network models of multiprogramming," PhD Thesis, Div. Eng. and Applied Physics, Harvard Univ., Cambridge, Mass., May 1971. (NTIS #AD 731 575, Aug. 1971.)Google Scholar
- BUZE71C BuZEN, J.P. "Optimizing the degree of multiprogramming in demand paging systems," in Proc. IEEE COMPCON, 1971, IEEE, New York, pp. 139-140.Google Scholar
- BUZE73 BUZEN, J. P. "Computational algorithms for closed queueing networks with exponential servers," Commun. ACM 16, 9 (Sept. 1973), 527-531. Google Scholar
- BUZE75 BUZEN, J. P. "Cost effective analytic tools for computer performance evaluation," in Proc. IEEE COMPCON, 1975, IEEE, New York, pp. 293-296.Google Scholar
- BUZE76a BUZEN, J.P. "Operational analysis: the key to the new generation of performance prediction tools," in Proc. IEEE COMPCON, 1976, IEEE, New York.Google Scholar
- BUZE76b BUZEN, J. P. "Fundamental operational laws of computer system performance," Acta Inf. 7, 2 (1976), 167-182.Google Scholar
- BUZE77 BUZEN, J.P. "Principles of computer performance modeling and prediction," in Infotech state of the art report on performance modehng and prediction, Infotech Int. Ltd., Maidenhead, UK, 1977, pp. 3-18.Google Scholar
- BUZE78a 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.Google Scholar
- BUZE78b BUZEN, J. P., et al. "BEST/I--design of a tool for computer system capacity planning," in Proc." 1978 AFIPS Na. aonal Computer Conf., Vol. 47, AFIPS Press, Montvale, N.J., pp. 447-455.Google Scholar
- CHAN75a CHANDY, K. M., HERZOG, U.; AND Woo, L. "Parametric analysis of queueing networks," IBM j. Res. Dev. 19, 1 (Jan. 1975), 36-42.Google Scholar
- CHAN75b CHANDY, K. M.; HERZOG, U.; AND Woo, L. "Approximate analyms of general queueing networks," IBM J Res Dev. 19, 1 (Jan. 1975), 43-49.Google Scholar
- CHAN78 CHANDY, K. M.; AND SAUER, C. H "Approximate methods for analyzing queuemg network models of computer systems," Comput. Surv. 10, 3 (Sept, 1978), 281-317 Google Scholar
- CHAN74 CHANG, A.; AND LAVENBERG, S. "Work rates in closed queueing networks with general mdependent servers," Oper. Res. 22, 4 (1974), 838-847.Google Scholar
- CHOW77 CHow, W. The cycle time d~stnbut~on of exponential central server queues, IBM Res. Rep. RC 6765, 1977.Google Scholar
- COFF73 COFFMAN, E G., JR., ,NV DENNING, P. J. Operating systems theory, Prentice- Hall, Englewood Cliffs, N.J., 1973. Google Scholar
- COUR75 CouRTols, P. J. "Decoml~osability, instabilities, and saturation in multiprogrammed systems," Commun. ACM 18, 7 (July 1975), 371-377. Google Scholar
- COUR77 COURTO,S, P. J. Decomposabihty. queueing and computer system applcations, Academic Press, New York, 1977.Google Scholar
- DENN72 DENNING, P. J. "A note on paging drum efficiency," Comput. Surv. 4, 1 (March 1972), 1-3. Google Scholar
- DENN75a DENNING, P. J.; AND KAHN, K.C. Some distribution-free properties of throughput and response ame, Tech. Rep. CSD- TR-159, Computer Science Dept., Purdue Univ., W. Lafayette, Ind., May 1975.Google Scholar
- DENN75b DENNING, P. J.; AND GRAHAM, G S. "Multlprogrammed memory management," Proc IEEE 63, 6 (June 1975), 924-939Google Scholar
- DENN76 DENNING, P. J.; KAHN, K. C.; LEROU- DIER, J; POTIER, D., AND SURI, R "Optimal multiprogramming," Acta Inf. 7, 2 (1976), 197-216.Google Scholar
- DENN77a DENNING, P. J.; AND BUZEN, J. P. "Operational analysis of queueing networks," in Proc. Third Int. Syrup. Computer Performance Modeling, Measure. ment, and Evaluation, 1977, North-Holland Publ. Co., Amsterdam, The Netherlands. Google Scholar
- DENN77b 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.Google Scholar
- DENS78 DENNING, P. J. "Optimal multiprogrammed memory management," in Current trends m programming meth. odology III, K. M. Chandy and R. Yeh (Eds.), Prentice-Hall, Englewood Cliffs, N.J., 1978, pp. 298-322.Google Scholar
- GARD76 GARDNER, M. "Mathematical games: On the fabric of inductive logic, and some probability paradoxes," Scl. Am 234, 3 (March 1976), 119-122.Google Scholar
- GELE76a GELENBE, E.; AND MUNTZ, R. R. "Probability models of computer systems I. exact results," Acta Inf. 7, 1 (May 1976), 35-60.Google Scholar
- GELE76b GELENBE, E., AND PUJOLLE, G. "The behavior of a single queue in a general queueing network," Acta Inf. 7, 2 (1976), 123-136.Google Scholar
- GIAM76 GIAMMO, T. "Validation of a computer perfo .nnance model of the exponential queuemg network family," Acta Inf. 7, 2 (1976), 137-152.Google Scholar
- GORD67 GORDON, W. J.; AND NEWELL, G. F. "Closed queueing systems with exponential servers," Oper. Res. 15 (1967), 254-265.Google Scholar
- HERZ75 HEaZOG, U.; Woo, L.; AND CHANDY, K. M. "Solution of queueingproblems by a recursive technique," IBM J. Res. Dev. 19, 3 (May 1975), 295-300.Google Scholar
- HUGH73 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.Google Scholar
- IGLE78 IGLEHART, D. L. "The regenerative method for simulation analysis," in Cur. rent trends in programming methodology III, K. M. Chandy and R. Yeh (Eds.), Prentice-Hall Englewood, Cliffs, N.J., 1978, pp. 52-71.Google Scholar
- JACK57 JACKSON, J. R. "Networks of waiting lines," Oper. Res. 5 (1957), 518-521.Google Scholar
- JACK63 JACKSON, J.R. "Jobshop like queueing systems," Manage. Scl. 10 (1963), 131-142.Google Scholar
- KLEI68 KI,EINROCK, L. "Certain analytic resuits for time shared processors," in Proc. IFIP Congress 1968, North-Holland Publ. Co., Amsterdam, The Netherlands, pp. 838-845.Google Scholar
- KLEI75 KLEINROCK, L. Queuemg systems I, John Wdey, New York, 1975.Google Scholar
- KLEI76 KLEINnOCK, L. Queuemg systems II, John Wiley, New York, 1976.Google Scholar
- LAZO77a LAZOWSKA, E.D. "The use of percentries m modelingCPU service time distributions," in Proc. Int. Syrup. Computer Performance Modeling, Measurement, and Evaluation, 1977, North-Holland Publ. Co., Amsterdam, The Netherlands, pp. 53-66.Google Scholar
- LAZO77b LAZOWSKA, E.D. "Charactertzing 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.) Google Scholar
- LIPS77 LIPSKY, L.; AND CHURCH, J. D. "Applications of a queuemg network model for a computer system," Comput. Surv. 9, 3 (Sept. 1977), 205-222. Google Scholar
- MOOR71 MOORE, C. G., III Network models for large-scale t~me sharing systems, Tech. Rep. 71-1, Dept. industrial Eng., Univ. Michigan, Ann Arbor, April 1971, PhD Thesis.Google Scholar
- MUNT74 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, Princeton Univ., Princeton, N.J., pp. 348-352.Google Scholar
- MUNT75 MUNTZ, R. R. "Analytic modeling of interactive systems," Proc IEEE 63, 6 (June 1975), 946-953.Google Scholar
- REIS75 REISER, M.; AND KOBAYSHI, H. "Queueing networks with multiple closed chains: theory and computation algorithms," IBM J. Res. Dev. 19 (May 1975), 283-294.Google Scholar
- REIS78 REISER, M.; AND SAUER, C. H. "Queuemg network models: methods of solution and their program implementations," in Current trends in programmmg methodology III, K. M. Chandy and R. Yeh (Eds.), Prentice-Hall, Englewood Cliffs, N.J., 1978, pp. 115-167.Google Scholar
- ROSE78 RosE, C.A. "Measurement procedure for queueing network models of computer systems," Comput Surv. 10, 3 (Sept. 1978), 263-280. Google Scholar
- SCHE67 SCHERR, A. L An analysts of time shared computer systems, MIT Press, Cambridge, Mass., 1967.Google Scholar
- SCHW78 SCHWETMAN, H. D. "Hybrid stmulatlon models of computer systems," Commun. ACM 21 (1978), to appear. Google Scholar
- SEVC77 SEVCIK, K.; LEVY, A. I., TIRIPATHI, S. K.; AND ZAHORJAN, J. L. "Improving approxtmations of aggregated queuemg network subsystems," in Proc. Int. Syrup. Computer Performance Modelrag, Measurement, and Evaluation, 1977, North-Holland Publ. Co., Amsterdam, The Netherlands, pp. 1-22.Google Scholar
- SHUM76 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.Google Scholar
- SHUM77 SHUM, A. W. C.; ~,ND BUZE~, 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. Google Scholar
- WILL76 WILLIAMS, A. C.; AND BHANDIWAD, R. A. "A generating function approach to queueing network analysis of multiprogrammed computers," Networks 6, 1 (1976), 1-22.Google Scholar
- WONG77 WoNt, J.W. "Distribution of end-toend delay in message-switched networks," Comput. Networks 2, 1 (Feb. 1978), 44-49.Google Scholar
Recommendations
Analysis of a queueing system with impatient customers and working vacations
QTNA '11: Proceedings of the 6th International Conference on Queueing Theory and Network ApplicationsIn this paper, we consider an M/M/1 queueing system with working vacations and impatient customers, where we examine the case that customers' impatience is due to a working vacation. During the working vacation, customers are served at a slower than ...
Intelligent Network Analysis by Closed Queuing Models
With the wide deployment of intelligent network (IN) services, there is an urgent need to understand and solve teletraffic performance issues of the evolving network intelligence platform. This paper discusses a queuing system model for the performance ...
Multiserver Queueing Models of Multiprocessing Systems
Conventional time sharing and multiprogramming systems have been extensively modeled as single-server queues. In contrast, multiprocessing systems must be modeled as multiserver queueing systems. This paper investigates the effect of the scheduling ...
Comments