Finding a Steady State Point for Fixed Priority Independent Periodic Real-Time Tasks with Arbitrary Given Release Offsets
Yue Qin, Xingliang Zou, Albert M. K. Cheng, Yu Jiang · 2017
Minimal schedulability interval is one of the important considerations of both research motivation and practice stage. In this paper, we investigate the problem of finding a starting time point of the minimal schedulability interval for fixed priority independent periodic real-time preemptive tasks with arbitrary given release offsets (phasing). A linked list-based method is proposed for solving the problem. Each node in the linked list represents a pending-less busy period. Analysis and experimental results show that the linked list-based method outperforms the current best acyclic-idle-slot-based one.