摘要: The central server model [3] represented a major advance in computer performance analysis when it was first introduced. Earlier mathematical models had investigated the of individual system components such as processors, disks and drums. Because they analyzed these isolation, early no way to represent powerful interactions that take place among ultimately determine overall performance.
springer.com
sci-hub.st 参考文章(9)
A. Brandwajn, A model of a time sharing virtual memory system solved using equivalence and decomposition methods Acta Informatica. ,vol. 4, pp. 11- 47 ,(1974) , 10.1007/BF00288934
Rajan Suri, Gregory W. W. Diehl, Suzanne de Treville, Michael J. Tomsicek, From CAN-Q to MPX: Evolution of Queuing Software for Manufacturing Interfaces. ,vol. 25, pp. 128- 150 ,(1995) , 10.1287/INTE.25.5.128
J. P. Buzen, Fundamental operational laws of computer system performance Acta Informatica. ,vol. 7, pp. 167- 182 ,(1976) , 10.1007/BF00265769
P. J. Courtois, Pierre-Jacques Courtois, Decomposability: Queueing and Computer System Applications ,(1977)
Forest Baskett, K. Mani Chandy, Richard R. Muntz, Fernando G. Palacios, Open, Closed, and Mixed Networks of Queues with Different Classes of Customers Journal of the ACM. ,vol. 22, pp. 248- 260 ,(1975) , 10.1145/321879.321887
M. Reiser, H. Kobayashi, Queuing networks with multiple closed chains: theory and computational algorithms Ibm Journal of Research and Development. ,vol. 19, pp. 283- 294 ,(1975) , 10.1147/RD.193.0283
Jeffrey P. Buzen, Computational algorithms for closed queueing networks with exponential servers Communications of the ACM. ,vol. 16, pp. 527- 531 ,(1973) , 10.1145/362342.362345
Peter J Denning, Jeffrey P Buzen, None, The Operational Analysis of Queueing Network Models ACM Computing Surveys. ,vol. 10, pp. 225- 261 ,(1978) , 10.1145/356733.356735
Jeffrey P Buzen, Queueing network models of multiprogramming ,(1980)