A model of a time-sharing virtual memory system solved using equivalence and decomposition methods

DOI10.1007/BF00288934zbMath0278.68025MaRDI QIDQ1394114

Alexandre Brandwajn

Publication date: 1974

Published in: Acta Informatica (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45) General topics in the theory of software (68N01)

Related Items (1)

Modelling contention sensing memory management systems: A VAX/VMS case study

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