摘要: We present a queueing network model of virtual memory computer system including the effect sharing among processes. Page fault and file request overheads are explicitly taken into account. The fact that some pages have to be saved in secondary at moment page fault, is also consideration. obtain an approximate solution using equivalence decomposition approach. program behavior parameters (primary size, drum disk characteristics, locality, input-output rates different ratios) as well total number processes, examined for two organizations. In first one, all processes share real core; second, having issued lose their space until I/O performed.
springer.com
acm.org
sci-hub.se 参考文章(17)
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)
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
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
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
P. J. Courtois, Decomposability, instabilities, and saturation in multiprogramming systems Communications of the ACM. ,vol. 18, pp. 371- 377 ,(1975) , 10.1145/360881.360887
James R. Jackson, Jobshop-Like Queueing Systems Management Science. ,vol. 50, pp. 1796- 1802 ,(2004) , 10.1287/MNSC.1040.0268
Herbert A. Simon, Aggregation of Variables in Dynamic Systems Econometrica. ,vol. 29, pp. 183- 213 ,(1955) , 10.1007/978-94-010-9521-1_12