Forest Baskett
- 1 BASKETT, F The dependence of computer system queues upon processing time distribution and central processor scheduling. Proc ACM-SIGOPS Third Symposmm on Operating System Principles, Stanford U., Stanford, Calif., Oct. 1971, pp. 109-113. Google Scholar
- 2 BASKETT, F., ~tND PALACZOS, F G. Processor shanng in a central server queueing model of mtfltaprogrammmg with apphcations. Proc. Sixth Annual Princeton Conference on Information Sciences and Systems, Princeton U, Princeton, N j. March 1972, pp. 598-603.Google Scholar
- 3 BUZEN, J. Queueing network models of multiprogramming. Ph.D. Th., Div. of Eng. and Appl. Sci., Harvard. U., Cambridge, Mass, 1971.Google Scholar
- 4 B~rzwN, J. Analysis of system bottlenecks using a queuemgnetwork model. Proc. ACM-SIGOPS Workshop on System Performance Evaluation, April 1971, pp. 82-103. Google Scholar
- 5 CHANDY, K. M The analysis and solutions for general queueing networks Proc. Sixth Annual Princeton Conference on Information Sciences and Systems, Princeton U,, Princeton, N. J., March 1972, pp. 224-228.Google Scholar
- 6 CHAND~C, K M., KELLER, T. W., AND BROWNE, J. C. Design automation and queueing networks: An interactive system for the evaluation of computer queueing models Proc. Ninth Annual Design Automation Workshop, Dallas, Tex., June 1972, pp 151-153. Google Scholar
- 7 Cox, D.R. A use of complex probabilities m the theory of stochastic processes. Proc. Cambr~.dge Phd. Soc. 51 (1955), 313-319Google Scholar
- 8 F~:LLER, W. An Introduction to Probab~hty Theory and Its Apphcat~ons, Vol. 1, 3rd ed Wiley, New York, 1968.Google Scholar
- 9 F~:RDINAND, A.E. An analysis of the machine interference model IBM Syst. J. 10, 2 (1971), 129-142.Google Scholar
- 10 GORDON, W J, AND NEWELL, G F. Closed queuemg systems with exponential servers Oper Res 15 (1967), 254-265Google Scholar
- 11 JACKSON, J R Jobshop-like queueing systems Manage. Sc~ 10, 1 (Oct 1963), 131-142Google Scholar
- 12 L,~VENBERO, S. S Queueing analysls of a multlprogrammed computer system having a multilevel storage hierarchy. SIAM J Comput 2, 4 (1973), 232-252.Google Scholar
- 13 MOORE, C G, III Network models for large-scale time-sharing systems Tech. Rep. No. 71-1, Dep. of Ind Eng, U of Michigan, Ann Arbor, Mich., April 1971Google Scholar
- 14 P~LACIOS, F G An analytic model of a multiprogrammingsystem including a job mix Rep TR4, De/). of Computer Sciences, U. of Texas at Austin, Austin, Tex., June 1972. Google Scholar
- 15 POSNER, M., AND BERNHOLTZ, B Closed fimte queuemg networks with time lags and with several classes of units Oper Res. 16 (1968), 977-985.Google Scholar
- 16 S.~KATA, M., NOGUCHI, S., AND OIZUMI, J Analysm of a processor-shared queueing model for time-sharing systems Proc Second Hawaii Internatmnal Conference on System Scmnces, U. of Hawaii, Hono}ulu, Hawaii, Jan 1969, pp 625-628.Google Scholar
- 17 WHITTLE, P Nonhnear migration processes. Internat. Stalzst Inst Bull ~2, Bk. 1 (1969), 642- 647.Google Scholar
- 18 rHITTLE, P. Equilibrium dlstnbutmns for an open mlgratmn process. J A ppl. Probabd. 5Google Scholar
Index Terms
- Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Recommendations
Integrally Closed Residuated Lattices
AbstractA residuated lattice is said to be integrally closed if it satisfies the quasiequations and , or equivalently, the equations and . Every integral, cancellative, or divisible residuated lattice is integrally closed,...
When to “Fire” Customers: Customer Cost-Based Pricing
The widespread adoption of activity-based costing enables firms to allocate common service costs to each customer, allowing for precise measurement of both the cost to serve a particular customer and the customer's profitability. In this paper, we ...
Comments