Abstract

We introduce a new general scheme for shared memory non-preemptive scheduling policies. Our scheme utilizes a system of inequalities and thresholds and accepts a packet if it does not violate any of the inequalities. We demonstrate that many of the existing policies can be described using our scheme, thus validating its generality. We propose a new scheduling policy, based on our general scheme, which we call the Harmonic policy. We analyze the Harmonic policy by means of competitive analysis and demonstrate that its throughput competitive ratio is almost optimal. Our simulations also show that the Harmonic policy both achieves high throughput and easily adapts to changing load conditions.

Citations