Analysis of a Continuum of Processor-Sharing Models for Time-Shared Computer Systems

摘要

Processor-sharing models of time-shared computer systems are defined and some new results are presented. The major emphasis of this research is on the modeling and analysis of new models of time-shared computer systems and on the finding of some fundamental properties which apply to the average number of customers in the system and the average response time functions for a large class of time-shared computer systems. The family of selfish scheduling algorithms is defined and the Laplace transform of the response time functions are obtained. A family of scheduling algorithms whose performance ranges between that of the RR system and the FB system is constructed. A simple relationship between the time-dependent average number of customers in the system and the average response time functions for a large class of M/M/1 systems is formulated. Finally, some fundamental properties are established which apply to the average response time functions for all time-shared computer systems. (Author)