A model of a time sharing virtual memory system solved using equivalence and decomposition methods
作者： A. Brandwajn
DOI: 10.1007/BF00288934
关键词:
摘要: A queueing network model of a time-sharing multiprogramming virtual memory system is presented including the effect of memory sharing among processes. An approximate explicit …
springer.com
sci-hub.se 参考文章(16)
Charles Gilbert Moore, Network models for large-scale time-sharing systems University of Michigan. ,(1971)
A. L. Scherr, AN ANALYSIS OF TIME-SHARED COMPUTER SYSTEMS Massachusetts Institute of Technology. ,(1965)
Jeffrey P Buzen, Queueing network models of multiprogramming ,(1980)
E. Gelenbe, D. Potier, A. Brandwajn, J. Lenfant, Gestion Optimale d'un Ordinateur Multiprogramme a Memoire Virtuelle Lecture Notes in Computer Science. pp. 132- 143 ,(1973) , 10.1007/3-540-06600-4_12
Jerome H. Saltzer, A simple linear model of demand paging performance Communications of the ACM. ,vol. 17, pp. 181- 186 ,(1974) , 10.1145/360924.360926
D. D. Chamberlin, S. H. Fuller, L. Y. Liu, An Analysis of Page Allocation Strategies for Multiprogramming Systems with Virtual Memory IBM Journal of Research and Development. ,vol. 17, pp. 404- 412 ,(1973) , 10.1147/RD.175.0404
Akira Sekino, Throughput analysis of multiprogrammed virtual-memory computer systems Proceedings of the 1973 ACM SIGME symposium. pp. 47- 53 ,(1973) , 10.1145/800268.809335
Laszlo A Belady, CJ Kuehner, None, Dynamic space-sharing in computer systems Communications of The ACM. ,vol. 12, pp. 282- 288 ,(1969) , 10.1145/362946.363002
James R. Jackson, Jobshop-Like Queueing Systems Management Science. ,vol. 50, pp. 1796- 1802 ,(2004) , 10.1287/MNSC.1040.0268