Queueing discipline in a system with time quantiztion
A typical problem associated with the organization of the computational process is considered. A new and sufficiently simple rule is proposed for computing the allocation quantum for a circular cyclic algorithm (CCA), based on the ''longer-waiting-longer-service'' discipline. The variable quantum CCA is shown to be superior to the constant quantum CCA. Some comparative simulation results are given.
scientific article; zbMATH DE number 3976323