A generating function approach to queueing network analysis of multiprogrammed computers

DOI10.1002/net.3230060102zbMath0328.90032MaRDI QIDQ4094636

R. A. Bhandiwad, Alton C. Williams

Publication date: 1976

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230060102

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

60K25: Queueing theory (aspects of probability theory)

90B10: Deterministic network models in operations research

68N01: General topics in the theory of software

Related Items

Theory of queuing networks and its applications to the analysis of information-computing systems, Estimating the Sojourn time sensitivity in queueing networks using perturbation analysis, Some efficient computational algorithms related to phase models, Perturbation analysis and optimization of queueing networks, Full-state perturbation analysis of discrete event dynamic systems, New performance sensitivity formulae for a class of product-form queueing networks, Validation of a computer performance model of the exponential queuing network family, Probabilistic models of computer systems. I: Exact results, A universal building block for the approximate analysis of a shared buffer ATM switch architecture, Calculating the normalization constants in queueing networks

Cites Work

• Computational Model of a Closed Queuing Network with Exponential Servers