A model of a time-sharing virtual memory system solved using equivalence and decomposition methods
From MaRDI portal
Publication:1394114
DOI10.1007/BF00288934zbMath0278.68025MaRDI QIDQ1394114
Publication date: 1974
Published in: Acta Informatica (Search for Journal in Brave)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- A Proof for the Queuing Formula: L = λW
- Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
- Control Schemes in Queueing Networks
- Dynamic space-sharing in computer systems
- Aggregation of Variables in Dynamic Systems
- Near-Decomposability, Partition and Aggregation, and the Relevance of Stability Discussions
- A remark on the rectification of the Joukowski profile
This page was built for publication: A model of a time-sharing virtual memory system solved using equivalence and decomposition methods