Notes on Modelling of Computer Systems and Networks.

Abstract : Formulation of given computer system or newtork problems into abstract stochastic models is considered. Generally speaking, model formulation is an art. While analytic results are clearly not powerful enough to provide a cookbook approach to modelling, general methodology and difficulties on model formulation are discussed through examinations of various computer system and network models. These models are presented in a systematic way based on the hierarchical approach. (Author)

[1]  D. Gaver.  Diffusion approximations and models for certain congestion problems , 1968, Journal of Applied Probability.

[2]  Hisashi Kobayashi,et al.  Accuracy of the diffusion approximation for some queuing systems , 1974 .

[3]  Arthur E. Ferdinand,et al.  An Analysis of the Machine Interference Model , 1971, IBM Syst. J..

[4]  P.J. Denning,et al.  Multiprogrammed memory management , 1975, Proceedings of the IEEE.

[5]  Erol Gelenbe,et al.  On Approximate Computer System Models , 1975, JACM.

[6]  K. Mani Chandy,et al.  Memory management and response time , 1977, CACM.

[7]  Gordon F. Newell,et al.  Applications of queueing theory , 1971 .

[8]  Gerald S. Shedler,et al.  Empirically derived micromodels for sequences of page exceptions , 1973 .

[9]  Jeffrey P. Buzen,et al.  Queueing Network Models of Multiprogramming , 1971, Outstanding Dissertations in the Computer Sciences.

[10]  Hisashi Kobayashi,et al.  Queuing Networks with Multiple Closed Chains: Theory and Computational Algorithms , 1975, IBM J. Res. Dev..

[11]  W. J. Gordon,et al.  Closed Queuing Systems with Exponential Servers , 1967, Oper. Res..

[12]  Philip S. Yu.  On accuracy improvement and applicability conditions of diffusion approximation with applications to modelling of computer systems , 1977 .

[13]  Jeffrey P. Buzen,et al.  Computational algorithms for closed queueing networks with exponential servers , 1973, Commun. ACM.

[14]  Michael J. Flynn,et al.  Some Computer Organizations and Their Effectiveness , 1972, IEEE Transactions on Computers.

[15]  P.-J. Courtois.  On the Near-Complete-Decomposability of Networks of Queues and of Stochastic Models of Multiprogramming Computing Systems , 1971 .

[16]  Donald P. Gaver,et al.  Processor Utilization in Multiprogramming Systems via Diffusion Approximations , 1973, Oper. Res..

[17]  K. Mani Chandy,et al.  Design automation and queueing networks: An interactive system for the evaluation of computer queueing models , 1972, DAC '72.

[18]  Samuel H. Fuller,et al.  An Analysis of Drum Storage Units , 1975, JACM.

[19]  B. Bernholtz,et al.  Closed Finite Queuing Networks with Time Lags and with Several Classes of Units , 1968, Oper. Res..

[20]  Louis Pouzin.  Cigale, The Packet Switching Machine of the Cyclades Computer Network , 1974, IFIP Congress.

[21]  D. Cox.  A use of complex probabilities in the theory of stochastic processes , 1955, Mathematical Proceedings of the Cambridge Philosophical Society.

[22]  P. Whittle.  Equilibrium distributions for an open migration process , 1968, Journal of Applied Probability.

[23]  Laszlo A. Belady,et al.  Dynamic space-sharing in computer systems , 1969, Commun. ACM.

[24]  Donald F. Towsley,et al.  Product Form and Local Balance in Queueing Networks , 1977, JACM.

[25]  Michael A. Crane,et al.  Simulating Stable Stochastic Systems, I: General Multiserver Queues , 1974, JACM.

[26]  Donald D. Chamberlin,et al.  An analysis of page allocation strategies for multiprogramming systems with virtual memory , 1973 .

[27]  William R. Franta,et al.  A diffusion approximate solution to the g/g/k queueing system , 1977, Comput. Oper. Res..

[28]  W. Feller.  Diffusion processes in one dimension , 1954 .

[29]  J. Kingman.  Some inequalities for the queue GI/G/1 , 1962 .

[30]  Donald L. Iglehart,et al.  Regenerative Simulation of Response Times in Networks of Queues , 1980, J. ACM.

[31]  F. Fisher,et al.  Near-Decomposability, Partition and Aggregation, and the Relevance of Stability Discussions , 1963 .

[32]  Charles Gilbert Moore,et al.  Network models for large-scale time-sharing systems , 1971 .

[33]  Donald P. Gaver,et al.  Approximate Models for Processor Utilization in Multiprogrammed Computer Systems , 1973, SIAM J. Comput..

[34]  Dileep Bhandarkar,et al.  Analysis of Memory Interference in Multiprocessors , 1975, IEEE Transactions on Computers.

[35]  Thomas G. Price,et al.  A Note on the Effect or the Central Processor Service Time Distribution on Processor Utilization in Multiprogrammed Computer Systems , 1976, JACM.

[36]  Simon S. Lam,et al.  Store-and-Forward Buffer Requirements in a Packet Switching Network , 1976, IEEE Trans. Commun..

[37]  W. R. Franta,et al.  A closed, cyclic, two-stage multiprogrammed system model and its diffusion approximation solution , 1974, SIGMETRICS '74.

[38]  Neil C. Wilhelm.  A General Model for the Performance of Disk Systems , 1977, J. ACM.

[39]  K. Mani Chandy,et al.  Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.

[40]  Pierre-Jacques Courtois,et al.  Decomposability, instabilities, and saturation in multiprogramming systems , 1975, CACM.

[41]  Hisashi Kobayashi,et al.  Queueing Models for Computer Communications System Analysis , 1977, IEEE Trans. Commun..

[42]  Yoshikuni Onozato,et al.  An Approximate Method for Design and Analysis of an ALOHA System , 1977, IEEE Trans. Commun..

[43]  Donald P. Gaver,et al.  Analysis of Remote Terminal Backlogs under Heavy Demand Conditions , 1971, JACM.