Simulating Stable Stochastic Systems, I: General Multiserver Queues
Journal of the ACM (JACM)
Simulating Stable Stochastic Systems, II: Markov Chains
Journal of the ACM (JACM)
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
Computer Models with Constrained Parallel Processors
Proceedings of the Sagamore Computer Conference on Parallel Processing
Configuration of computing systems: an approach using queueing network models.
Configuration of computing systems: an approach using queueing network models.
An analysis of time-sharing computer systems using Markov models
AFIPS '66 (Spring) Proceedings of the April 26-28, 1966, Spring joint computer conference
Markovian models and numerical analysis of computer system behavior
AFIPS '66 (Spring) Proceedings of the April 26-28, 1966, Spring joint computer conference
The Degradation in Memory Utilization Due to Dependencies
IEEE Transactions on Computers
Predicting departure times in multi-stage queueing systems
Computers and Operations Research
Optimal allocation of buffers and customers in a two-node cyclic network with multiple servers
Operations Research Letters
| Hi-index | 0.01 |
Service time distributions at computer processing units are often nonexponential. Empirical studies show that different programs may have markedly different processing time requirements. When queuing disciplines are first come, first served, preemptive priority or nonpreemptive priority, models reflecting these characteristics are difficult to analyze exactly. Available approximate techniques are often too expensive for parametric analysis. Inexpensive approximate techniques for solution of central server models with the above characteristics are presented. Ther esults of these techniques are validated with simulation results.