Assigning Priorities for Fixed Priority Preemption Threshold Scheduling

Abstract EN

Preemption threshold scheduling (PTS) enhances real-time schedulability by controlling preemptiveness of tasks.

This benefit of PTS highly depends on a proper algorithm that assigns each task feasible scheduling attributes, which are priority and preemption threshold.

Due to the existence of an efficient optimal preemption threshold assignment algorithm that works with fully assigned priority orderings, we need an optimal priority assignment algorithm for PTS.

This paper analyzes the inefficiency or nonoptimality of the previously proposed optimal priority assignment algorithms for PTS.

We develop theorems for exhaustively but safely pruning infeasible priority orderings while assigning priorities to tasks for PTS.

Based on the developed theorems, we correct the previously proposed optimal priority assignment algorithm for PTS.

We also propose a performance improved optimal priority assignment algorithm for PTS proving its optimality.

The empirical evaluation results clearly show the effectiveness of the proposed algorithm.