AN ANALYSIS OF TIME-SHARED COMPUTER SYSTEMS
AN ANALYSIS OF TIME-SHARED COMPUTER SYSTEMS
Fairness in processor scheduling in time sharing systems
ACM SIGOPS Operating Systems Review
Storage Requirements for Information Handling Centers
Journal of the ACM (JACM)
A Dynamic Time-Sharing Priority Queue
Journal of the ACM (JACM)
A Note on Some Mathematical Models of Time-Sharing Systems
Journal of the ACM (JACM)
A Generalized Multi-Entrance Time-Sharing Priority Queue
Journal of the ACM (JACM)
A Survey of Analytical Time-Sharing Models
ACM Computing Surveys (CSUR)
A processor allocation method for time-sharing
Communications of the ACM
ACM '72 Proceedings of the ACM annual conference - Volume 1
Design considerations of statistical multiplexors
Proceedings of the first ACM symposium on Problems in the optimization of data communications systems
Simulation of dispatching algorithms in a multiprogramming environment
ACM '72 Proceedings of the ACM annual conference - Volume 2
Analysis of computer peripheral interference
ACM '67 Proceedings of the 1967 22nd national conference
Simulation and mathematical modeling of an on-line accounting system
Proceedings of the fourth annual conference on Applications of simulation
Studies in Markov models of computer systems
ACM '75 Proceedings of the 1975 annual conference
Schedule—constrained job scheduling in a multiprogrammed computer system
WSC '74 Proceedings of the 7th conference on Winter simulation - Volume 2
The UTS time-sharing system: performance analysis and instrumentation
SOSP '69 Proceedings of the second symposium on Operating systems principles
On the Design of Bayesian Storage Allocation Algorithms for Paging and Segmentation
IEEE Transactions on Computers
AFIPS '69 (Fall) Proceedings of the November 18-20, 1969, fall joint computer conference
A study of asynchronous time division multiplexing for time-sharing computer systems
AFIPS '69 (Fall) Proceedings of the November 18-20, 1969, fall joint computer conference
A mathematical model to estimate average response time of parallel programs
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.02 |
A mathematical derivation of expected response time is presented for selected cyclic and priority scheduling disciplines, thereby demonstrating analytic techniques which may be utilized to evaluate such servicing doctrines. To illustrate the constant time quantum (round-robin) results, a hypothetical is defined and resolved.