ABSTRACT. A single-server processor-sharing system with M job classes is analyzed in the steady state. The scheduling strategy considered divides the total processor capacity in unequal fractions among the different job classes. More precisely, if there are N~jobs of classj in the system, j = 1, 2 ..... M, each class k job receives a fraction gh/(~M.~ giN~) of the processor capacity. Earlier analyses of this system are shown to be incorrect and new expressions for the conditional expected response times Wk(t) of class k jobs with required service time t are obtained (for general required service time distributions). These yield the asymptotic behavior of W~(t) as t ~ oo and rather simple formulas in the exponential case. The unconditional average response times are also obtained. KEY WORDS AND PHRASES: processor sharing, strategy, egalitarian, discriminatory job classes, Laplace transform, Fourier-Stiehjes transform CR CATEGORIES: 4.35.4.6, 5.5, 6.2
[1]
Edward G. Coffman,et al.
Distribution of Attained Service in Time-Shared Systems
,
1967,
J. Comput. Syst. Sci..
[2]
K. Mani Chandy,et al.
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
,
1975,
JACM.
[3]
Leonard Kleinrock,et al.
Time-shared Systems: a theoretical treatment
,
1967,
JACM.
[4]
T. M. O'Donovan.
Direct Solutions of M/G/1 Processor-Sharing Models
,
1974,
Oper. Res..
[5]
Thomas M. O'Donovan.
Technical Note - Distribution of Attained and Residual Service in General Queuing Systems
,
1974,
Oper. Res..
[6]
I. S. Gradshteyn,et al.
Table of Integrals, Series, and Products
,
1976
.