Stochastic processes
Queueing in a memory-shared computer*
ACM '64 Proceedings of the 1964 19th ACM national conference
An analysis of time-sharing computer systems using Markov models
AFIPS '66 (Spring) Proceedings of the April 26-28, 1966, Spring joint computer conference
Analysis of an Information System Model with Transfer Penalties
IEEE Transactions on Computers
An analysis of time-sharing computer systems using Markov models
AFIPS '66 (Spring) Proceedings of the April 26-28, 1966, Spring joint computer conference
RESQ: a package for solution of generalized queueing networks
AFIPS '77 Proceedings of the June 13-16, 1977, national computer conference
Approximate analysis of central server models
IBM Journal of Research and Development
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.02 |
The advent of multiple-access computing, the increasing variety of processors in systems, and the growing use of multiprocessing and multiprogramming in computing systems has put many new burdens on the computing system designer-planner-programmer. The selection of suitable system structure and programming structure, as well as the selection of scheduling rules, requires a much more detailed and precise understanding of the stochastic behavior of system traffic than has been required in the past. In short, the "architect" of system hardware and software is finding a need for more and more insight into the behavior of computers as networks of queues and processors.