An Improved Rate Monotonic Schedulability Test Algorithm

• DOI: 10.1360/jos160089e
• Publication Date: 2005-05-30T03:30:39Z
• Authors: Jun-Xiang LIU
• Keywords: 0102 computer and information sciences; 01 natural sciences

One of the key issues in real-time theory is schedulable analysis a given task set with fixed priority.All proposed schedulability test methods can be classified into two types: polynomial time and exact methods.Polynomial use sufficient condition, several least upper bounds processor utilization under ideal assumptions have been developed.Exact based on necessary condition guarantee that result for every correct.However, pseudo-polynomial complexity tests too complex to executed online large sets.This paper presents novel ISTA (improved algorithm) analyzing periodic sets Rate Monotonic priority assignment.A pruning theorem Task_i space derived, correlation among tasks its effect are investigated, related theorems proven.Based above results, new improved algorithm developed,