A model of a time sharing virtual memory system solved using equivalence and decomposition methods
- 1 January 1974
- journal article
- Published by Springer Nature in Acta Informatica
- Vol. 4 (1), 11-47
- https://doi.org/10.1007/bf00288934
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- An Analysis of Page Allocation Strategies for Multiprogramming Systems with Virtual MemoryIBM Journal of Research and Development, 1973
- Gestion Optimale d'un Ordinateur Multiprogramme a Memoire VirtuelleLecture Notes in Computer Science, 1973
- Throughput analysis of multiprogrammed virtual-memory computer systemsPublished by Association for Computing Machinery (ACM) ,1973
- The optimal organization of multiprogrammed multi-level memoryPublished by Association for Computing Machinery (ACM) ,1971
- Analysis of system bottlenecks using a queueing network modelPublished by Association for Computing Machinery (ACM) ,1971
- Dynamic space-sharing in computer systemsCommunications of the ACM, 1969
- Jobshop-Like Queueing SystemsManagement Science, 1963
- Near-Decomposability, Partition and Aggregation, and the Relevance of Stability DiscussionsInternational Economic Review, 1963
- A Proof for the Queuing Formula: L = λWOperations Research, 1961
- Aggregation of Variables in Dynamic SystemsEconometrica, 1961