Lowest priority first based feasibility analysis of real-time systems
A feasibility test for RM is proposed by testing system infeasibility. Results are applicable to systems where deadlines are not larger than task periods. Theoretical foundation for lowest priority task first (LPF) approach is provided. The timing constraints of system under investigation are kept intact. The presented work dominates existing counterparts from performance perspectives.
feasibility analysis real-time systems fixed-priority scheduling online schedulability