K. Mani Chandy
- BARD77 BARD, Y. "The modeling of some scheduling strategies for an interactive computer system," m Computer performance, K. M Chandy and M. Reiser (Eds.), Elsevier North-Holland, Inc., New York, 1977, pp. 113-138.Google Scholar
- BARD78 BARD, Y "The UM/370 performance predictor," Comput. Surv. 10, 3 (Sept. 1978), 333-342. Google Scholar
- BASK75 BASKETT, F., CHANDY, K.M., MUNTZ, R.R.; AND PALACIOS-GOMEZ, F. "Open, closed and mixed networks of queues with different classes of customers," J. A CM 22, 2 (April 1975), 248-260 Google Scholar
- BROW75 BROWNE, J. C.; CHANDY, K. M.; BROWN, R. M.; KELLER, T. W., TOWSLEY, D. F., AND DmSL~.Y, C W. "Hierarchical techtuques for development of realistic models of complex computer systems," Proc. IEEE 63, (June 1975), 966-975Google Scholar
- BROW77 BROWN, R. M.; BROWNE, J. C.; AND CHANDY, S. M. "Memory management and response time," Commun. ACM 20, 3 (March 1977), 153-165. Google Scholar
- BUX77 Bux, W.; AND HZRZO~~, U. "The phase concept: approximation of measured data and performance analysis," in Computer performance, K.M. Chandy and M. Reiser (Eds.), Elsevier North-Holland, Inc., New York, 1977, pp. 23-38.Google Scholar
- CHAN72 CHANDY, K. M. "The analysis and solutions for general queueing networks," m Proc. 6th Annual Princeton Conf Informatron Science and Systems, 1972, pp. 224-228.Google Scholar
- CHAN75a CHANDY, K. M.; HERZOG, U.; AND WOO, L S. "Parametric analysis of queuemg networks," IBM J. Res Dev 19, (Jan. 1975), 36-42.Google Scholar
- CHAN75b CHANDY, K. M, HERZOG, U, AND Woo, L. S. "Approximate analysis of general queueing networks," IBM J. Res Dev. 19, (Jan. 1975), 43-49.Google Scholar
- CHAN77 CHANDY, K M.; HOWARD, J H.; AND TOWSLEY, D F. "Product form and local balance in queueing networks," J A CM 24, 2 (April 1977), 250-263. Google Scholar
- CHIU78 CHIU, W. W.; AND CHOW, W. M. A hybrid hwrarchical model of a multiple vwtual storage (MVS) operatmg system, RC- 6947, IBM Research, Yorktown Heights, N.Y., Jan. 1978.Google Scholar
- COUR75 COURTOIS, P. J. "Decomposability, instabilities and saturation in multlprogrammmg systems," Commun. ACM 18, 7 (July 1975), 371-376 Google Scholar
- COUR77 COURTOIS, P J. Decomposabdzty queueing and computer system apphcatlons, Academic Press, Inc, New York, 1977.Google Scholar
- COX55 Cox, D. R. "A use of complex probabflitms m the theory of stochastm processes," Proc. Cambridge Phdos. Soc. 51, (1955), 313-319Google Scholar
- COX65 Cox, D R., AND MILLER, H. D. The theory of stochastic processes, John Wiley and Sons, Inc., New York, 1965.Google Scholar
- DENN76 DENNING, P. J., AND KAHN, K. C. "An L = S criterion for optimal multiprogramming," in Proc Int Symp. Computer Performance Modeling, Measurement and Evaluatton, 1976, P.P.S. Chen and M. Franklin (Eds), ACM, New York, and IFIP, Geneva, pp. 219-229. Google Scholar
- DENN78 DENNING, P J., AND BUZEN, J. P. "The operational analysis of queueing network models," Comput. Surv. 10, 3 (Sept 1978), 225-261. Google Scholar
- DISN74 DISNEY, R. L" AND CHERRY, W. P "Some topics in queuelng network theory," in Mathematwal methods m queueing theory, A. B. Clarke (Ed.), Springer-Verlag New York, Inc., New York, 1974.Google Scholar
- DRAK67 DRAKE, A W. Fundamentals of applted probabdtty theory, McGraw-Hill, Inc, New York, 1967 Google Scholar
- FOSC77 FoscmNI, G. J. "On heavy traffic diffusion analysis and dynamic routing in packet switched networks," in Computer performance, K.M. Chandy and M. Reiser (Eds.), Elsevier North-Holland, Inc., New York, 1977, pp. 419-514.Google Scholar
- FOST74 FOSTER, D. V.; MCGEHEARTY, P. F., SAUER, C, H,; AND WAGGONER, C. N. "A language for analysm of queueing models," in Proc. F~flh Annual P~ttsburgh Modelmg and Simulation Conf., 1974, pp. 381-386.Google Scholar
- GAVE68 GAVER, D. P. "Diffusion approxlmattons and models for certain congestmn problems," J. Appl. Probab. 5, (1968), 607-623.Google Scholar
- GAVE76 GAVER, D. P.; AND HUMFELD, G. "Multitype multiprogramming probability models and numerical procedures," Computer performance, Elsevmr North-Holland, Inc., New York 1976, pp. 38-43 Google Scholar
- GELE75 GELENBE, E. "On approximate computer system models," J. A CM 22, 2 (April 1975), 261-269. Google Scholar
- GELE76 GELENBE, E.; AND PUJOLLE, G "The behavior of a single queue in a general queueing network," Acta Inf 7, (1976), 123-136.Google Scholar
- GORD67 GORDON, W. J.; AND NEWELL, G F. "Closed queuemg networks with exponentml servers," Oper. Res. 15, (1967), 254-265.Google Scholar
- HERZ75 HERZOG, U., Woo, L S.; AND CHANDY, K. M "Solutmn of queuemg problems by a recurswe technique," IBM J. Res Dev. 19, (May 1975), 295-300.Google Scholar
- IGLE78 IGLEHART, D. L "The regenerative method for simulation analysis," in Current trends m programming methodology, Vol. III software modeling and ~ts impact on performance, K. M. Chandy and R. T. Yeh (Eds.), Prentice-Hall, Inc., Englewood Cliffs, N J., 1978, pp 52-71.Google Scholar
- INFO75 INFORMATION RESEARCH ASSOCIATES, User's manual for the ASQ system, I R A, Austin, Texas. 1975.Google Scholar
- IRLA75 IRLAND, M. "Queuemg analysm of a buffer aUocatmn scheme for a packet switch," m Proc. National Telecommunwatlons Conf., IEEE, New York, 1975, p 24Google Scholar
- JACK63 JACKSON, J R "Jobshop-hke queuemg systems," Manage. Sc~ 10, (1963), 131- 142Google Scholar
- KELL73 KELLER, T W. ASQ user's manual, TR- 27, Computer Science Dept., Umv Texas at Austin, Texas, 1973.Google Scholar
- KELL76 KELLER, T. W "Computer systems models with passive resources," PhD Thesis, Umv. Texas at Austin, 1976. Google Scholar
- KOBA74 KOBAYASHI, H "Applicatmn of the diffusion approxlmatmn to queuemg networks I: equilibrium queue dlstnbutmns," J. ACM 21, 2 {April 1974), 316-328. Google Scholar
- KOBA78 KOBAYASHI, H. Modelhng and analysis an mtroductmn to system performance evaluatmn methodology, Addison-Wesley Publ Co, Reading, Mass, 1978, Ch 4Google Scholar
- LAM76 LAM, S. S. "Store-and-forward buffer reqmrements in a packet swRchmg network," IEEE Trans Commun 24, (April 1976}, 394-403.Google Scholar
- LAVE75 LAVENBERG, S. S, AND SLUTZ, D R. "Introductmn to regenerative s~mulatlon," IBM J. Res. Dev 19, (Sept 1975), 458-463.Google Scholar
- LAVE77 LAVENBERG, S S, AND SAUER, C H. "Sequentml stopping rules for the regenerative method of simulation," IBM J Res Dev. 21, (Nov. 1977), 545-558Google Scholar
- LAZO77 LAZOWSKA, E D. "The use of percentiles in modeling CPU servwe time distributions," m Computer performance, K.M. Chandy and M Reiser (Eds.), Elsevmr North-Holland, Inc., New York, 1977, pp. 53-66.Google Scholar
- MACN75 MACNAIR, E. A; AND WOO, L S. Private communicatmn, 1975.Google Scholar
- REIS74 REISER, M., AND KOBAYASHI, H. "Accuracy of the diffusion approximation for some queuelng systems," IBM J. Res Dec. 18, (1974).Google Scholar
- REIS75 REISER, M., AND KOBAYASHI, H. "Queuemg networks with multiple closed chains theory and computational algorithms," IBM J Res. Dec 19, 3 {May 1975), 283-294.Google Scholar
- REIS76 REISER, M "Interactive modehng of computer systems," IBM Syst J 15, (1976), 309-327.Google Scholar
- REIS78 REISER, M;AND SAUER, C H. "Queuelng network models methods of soluhon and their program implementation," in Current trends ~n programmtng methodology, Vol. III software modehng and tts tmpact on performance, K. M Chandy and R. T. Yeh (Eds.), Prentme-Hall, Inc., Englewood Chffs, N J, 1978, pp. 115-167.Google Scholar
- SAUE75a SAUER, C. H. "Configuration of computing systems: an approach using queueing network models," PhD Thesis, Umv Texas at Austin, May 1975. Google Scholar
- SAUE75b SAUER, C. H, AND CHANDY, K. M "Approximate analysis of central server models," IBM J. Res. Dec 19, (May 1975), 301-313Google Scholar
- SAUE76 SAUER, C H., Woo, L S, AND CHANG, W Hybrid analys~s/slmulatmn" d~strtbuted networks, RC-634I, IBM Research, Yorktown Heights, N Y., June 1976Google Scholar
- SAUE77a SAUER, C H. Conftdence tntervals for queue~ng s~mulattons of computer systterns, RC-6669, IBM Research, Yorktown Heights, N.Y, July 1977Google Scholar
- SAUE77b SAUER, C. H, AND CHANDY, K M. The impact of d~str~butions and d~sctphnes on multtple processor systems, RC-6621, IBM Research, Yorktown Heights, N Y, July 1977. Also to appear m Commun. A CM Google Scholar
- SAUE77C SAUER, C H., AND MACNAIR, E A. Computer/communtcatmn system modehng w~th extended queue~ng networks, RC- 6654, IBM Research, Yorktown Heights, N Y., July 1977.Google Scholar
- SAUE78 SAUER, C H, AND MACNAIR, E A Queue~ng network software of systems modehng, RC-7143, IBM Research, Yorktown Heights, N.Y, May 1978.Google Scholar
- SCHW78 SCHWETMANN, H. D "Hybrid slmulatmn models of computer systems," to appear m Commun. A CM, 1978. Google Scholar
- SEKI71 SEKINO, A Performance evaluatmn of multlprogrammed trine.shared computer systems, Proj. MAC TR-103, MIT, Cambridge, Mass., Sept 1971Google Scholar
- SEVC77a SEVCIK, K C "Prmrity scheduling dlsclphnes m queueing network models of computer systems," m Proc IFIP Congress 77, North-Holland Publ. Co., Amsterdam, pp. 565-570Google Scholar
- SEVC77b SEVCIK, K C., LEVY, A I., TRIPATHI, S. K., AND ZAHORJAN, J L. "Improving approxlmatmns of aggregated queuemg network subsystems," m Computer performance, K.M Chandy and M. Reiser (Eds.), Elsewer North-Holland Inc., New York, 1977, pp. 1-22Google Scholar
- SHUM77 SHUM, A., AND BUZEN, J. P. "The EPF techmque, a method for obtaining approximate solutmns to closed queueing networks with general servme t~mes," in Measuring modehng & evaluating computer systems, H. Beilner and E. Gelenbe (Eds.), North-Holland Publ. Co, Amsterdam, 1977, pp. 201-220. Google Scholar
- STEW78 STEWART, W. J "A comparison of numerreal techmques m Markov modehng," Commun. ACM 21, (Feb. 1978), 144-151. Google Scholar
- TOWS75 TowsLsY, D. F. "Local balance models of computer systems," PhD Thesis, Univ Texas at Austin, Dec. 1975. Google Scholar
- WALL66 WALLACE, V. L., AND ROSENBERG, R. S "Markovmn models and numermal analysis of computer system behavmr," in Proc. 1966 AFIPS Spring Jr. Computer Conf., Vol 28, Spartan Books, Washington, D C., pp 141-148Google Scholar
- WOLF77 WOLFF, R W. "The effect of servme time regularity on system performance," m Computer performance, K.M. Chandy and M. Relser (Eds.), Elsevier North-Holland, Inc, New York, 1977, ~)~). 297-304.Google Scholar
- WONG78 WONG, J W. Queuemg network modehng of computer commumcation networks," Comput. Surv 10, 3 (Sept. 1978), 343-351, Google Scholar
- ZAHO77 ZAHORJAN, J. L. "Iterat~ve aggregatmn with global balance," Project SAM Notes, Umv. of Toronto, Toronto, Ont, Canada, Feb 1977.Google Scholar
Recommendations
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 ...
Feedback Queueing Models for Time-Shared Systems
Time-shared processing systems (e.g. communication or computer systems) are studied by considering priority disciplines operating in a stochastic queueing environment. Results are obtained for the average time spent in the system, conditioned on the ...
Approximate Queuing Models for Multiprogramming Computer Systems
In a multiprogramming computer system several jobs may be handled simultaneously by utilizing the central processing unit in processing one job while other jobs are being served by the peripheral devices. Our analysis of such a computer system proceeds ...
Comments