Some Mathematical Considerations of Time-Sharing Scheduling Algorithms
Jack E. Shemer · Journal of the ACM · 1967
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.