A queueing discipline in a system with time quantization

A relevant problem in organization of the computing process is considered. A new fairly, simple rule is proposed for computing the service quantum for a cyclic algorithm, CA, operating by the first in last out principle. Advantages of a CA where the servicing quantum is variable over a constant quantum CA are demonstrated. The results of modeling are given.