论文信息 - Throughput bounds for closed queueing networks - 字舞流文

Throughput bounds for closed queueing networks

Jiri Kriz | J. Kriz

[1] Lester Lipsky,et al. On the asymptotic behavior of time-sharing systems , 1982, CACM.

[2] Derek L. Eager,et al. Performance bound hierarchies for queueing networks , 1982, TOCS.

[3] Simon S. Lam,et al. Dynamic Scaling and Growth Behavior of Queuing Network Normalization Constants , 1982, JACM.

[4] K. Mani Chandy,et al. Linearizer: a heuristic algorithm for queueing network models of computing systems , 1982, CACM.

[5] John Zahorjan,et al. Balanced job bound analysis of queueing networks , 1982, CACM.

[6] Stephen S. Lavenberg,et al. Mean-Value Analysis of Closed Multichain Queuing Networks , 1980, JACM.

[7] Peter J. Denning,et al. The Operational Analysis of Queueing Network Models , 1978, CSUR.

[8] K. Mani Chandy,et al. Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.

[9] S. S. Lavenberg,et al. Work Rates in Closed Queuing Networks with General Independent Servers , 1974, Oper. Res..

[10] Jeffrey P. Buzen,et al. Computational algorithms for closed queueing networks with exponential servers , 1973, Commun. ACM.