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.
No takes yet. Share an insight, caveat, or question.
Fayolle et al. (1980) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: