A Simple Probability Model Yielding Performance Bounds for Modular Memory Systems
暂无分享,去创建一个
A simple probability model is defined that represents modular memory systems under saturation demand for storage. An analysis of the model based on the theory of finite Markov chains leads to results that demonstrate the effects of changes in loading times and the number of modules on system performance.
[1] P. D. Finch. The Effect of the Size of the Waiting Room on a Simple Queue , 1958 .
[2] Jack B. Dennis,et al. Segmentation and the Design of Multiprogrammed Computer Systems , 1965, JACM.
[3] D. F. Votaw,et al. Queuing Systems with Bounded Waiting-Line Length , 1966, Oper. Res..