Fundamental operational laws of computer system performance
From MaRDI portal
Cites work
- A Proof for the Queuing Formula: L = λW
- A Simple Proof of: L = λW
- Fundamental operational laws of computer system performance
- scientific article; zbMATH DE number 3478408 (Why is no real title available?)
- scientific article; zbMATH DE number 3223982 (Why is no real title available?)
- scientific article; zbMATH DE number 3326075 (Why is no real title available?)
- Work Rates in Closed Queuing Networks with General Independent Servers
Cited in
(10)- Stationary deterministic flows in discrete systems. I
- Deterministic analysis of queueing systems with heterogeneous servers
- Fundamental operational laws of computer system performance
- Discrete event simulation modelling of computer systems for performance evaluation
- Waiting time estimation in a manufacturing system using the number of machine idle periods
- Stochastic grey-box modeling of queueing systems: fitting birth-and-death processes to data
- Fitting birth-and-death queueing models to data
- Extending the FCLT version of \(L=\lambda W\)
- A new procedure to estimate waiting time in \(GI/G/2\) system by server observation
- Models of central capacity and concurrency
This page was built for publication: Fundamental operational laws of computer system performance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1225938)
