A Simple Probability Model Yielding Performance Bounds for Modular Memory Systems
- 1 January 1968
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-17 (1) , 86-89
- https://doi.org/10.1109/tc.1968.5008878
Abstract
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.Keywords
This publication has 2 references indexed in Scilit:
- Queuing Systems with Bounded Waiting-Line LengthOperations Research, 1966
- Segmentation and the Design of Multiprogrammed Computer SystemsJournal of the ACM, 1965