Approximate Queuing Models for Multiprogramming Computer Systems

DOI10.1287/OPRE.21.6.1212MaRDI QIDQ4776846zbMATH OpenOpenAlexFDO

Authors Benjamin Avi-Itzhak, Daniel P. Heyman

Publication date 1973

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.21.6.1212

Mathematics Subject Classification ID

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

Cited in

(12)

• Multiprogramming with virtual memory - a queueing model
• Analysis of semi-open queueing networks using lost customers approximation with an application to robotic mobile fulfilment systems
• Discrete event simulation modelling of computer systems for performance evaluation
• Solving semi-open queuing networks with time-varying arrivals: an application in container terminal landside operations
• A multi-tier linking approach to analyze performance of autonomous vehicle-based storage and retrieval systems
• Approximate techniques for general closed queueing networks with subnetworks having population constraints
• A nested semi-open queuing network model for analyzing dine-in restaurant performance
• A new solution approach for multi-stage semi-open queuing networks: an application in shuttle-based compact storage systems
• Probabilistic models of computer systems. I: Exact results
• Performance analysis of a multiprogramming-multiprocessor retrial queueing system with orderly reattempts
• Validation of a computer performance model of the exponential queuing network family
• The mathematical analysis of the computer system modeled as a two stage cyclic queue

This page was built for publication: Approximate Queuing Models for Multiprogramming Computer Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4776846)