A MATHEMATICAL ANALYSIS OF COMPUTER TIMESHARING SYSTEMS.
Interim technical rept. no. 20 (master's thesis),
MASSACHUSETTS INST OF TECH CAMBRIDGE OPERATIONS RESEARCH CENTER
Pagination or Media Count:
Two important and popular time-sharing systems were analysed for the expected waits of requests. These were the Round-Robin and the Dynamic-Priority Multiple-Level systems. The Round-Robin is very complex in all its generality, however with the aid of a realistic simplifying assumption the desired expected waits were calculated. The Round-Robin under worst conditions i.e. full load was analysed rigorously. The Dynamic-Priority MultipleLevel System considered was slightly different from the one implemented by Prof. Corbato of M. I. T. Here again results were complex in general, but were derived generally nevertheless. Specialization of these results should simplify them somewhat. Author