Some Mathematical Considerations of Time-Sharing Scheduling Algorithms

1 April 1967

journal article
Published by Association for Computing Machinery (ACM) in Journal of the ACM

Vol. 14 (2) , 262-272
https://doi.org/10.1145/321386.321389

Abstract

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.

Keywords

SERVICING DOCTRINES
EXPECTED RESPONSE
TIME SHARING
MATHEMATICAL CONSIDERATIONS
SHARING SCHEDULING
ANALYTIC TECHNIQUES
DEMONSTRATING ANALYTIC
SELECTED CYCLIC

This publication has 2 references indexed in Scilit:

A queuing model for a simple case of time sharing
IBM Systems Journal, 1966
Priority Assignment in Waiting Line Problems
Journal of the Operations Research Society of America, 1954