Minimal Schedulability Testing Interval for Real-Time Periodic Tasks with Arbitrary Release Offsets
Yu Jiang, Qiang Zhou, Xingliang Zou, Albert M. K. Cheng · 2014
The concept of feasibility (or schedulability) interval plays a very important role in the schedulability analysis in real-time systems. Existing results on the schedulability testing interval of real-time task sets under fixed priority scheduling with arbitrary release offsets (or phases) have limitations for certain scenarios in constructing a schedule for testing the schedulability of a given task set. In this paper, we propose a transforming method for deriving minimal schedulability testing interval of real-time n-task sets with arbitrary release offsets under fixed priority scheduling in both the classical pre-emptive model and the Priority-based Functional Reactive Programming (P-FRP) model on uniprocessor. The complexity of our transforming method is O(n), and the validity is also proved by theoretical analysis.