Solution Space for Fixed-Priority with Preemption Threshold

Authors:
Jiongxiong Chen;Ashif Harji;Peter Buhr
Affiliations:
University of Waterloo, Canada;University of Waterloo, Canada;University of Waterloo, Canada
Venue:
RTAS '05 Proceedings of the 11th IEEE Real Time on Embedded Technology and Applications Symposium
Year:
2005

Citing 0
Cited 3

Leakage-Aware Energy Efficient Scheduling for Fixed-Priority Tasks with Preemption Thresholds

ADMA '08 Proceedings of the 4th international conference on Advanced Data Mining and Applications
Analysis on quantum-based fixed priority scheduling of real-time tasks

Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
Dual ceiling protocol for real-time synchronization under preemption threshold scheduling

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper reaffirms that fixed-priority with pre-emption threshold (FPPT) is an important form of real-time scheduling algorithm, which fills the gap between fixed-priority preemptive (FPP) and fixed-priority non-preemptive (FPNP). When a task set is schedulable by FPPT, there may exist multiple valid preemption threshold assignments, which provide useful scheduling options. All valid assignments form a solution space that is delimited by a minimal and maximal assignment. A mechanism is presented to generate part of the valid assignments once the minimal and maximal assignments are known. The known algorithm to compute the minimal assignment starts at FPP, and the known algorithm to compute the maximal assignment starts from any valid assignment. This paper presents algorithms to compute the minimal and maximal assignments starting from FPNP, and the proofs for the correctness of these algorithms are also presented.