Higher Initial Value for Time Demand Analysis

摘要

Time demand analysis of real-time has been an active research area and a plethora of results have been derived for the classing time demand analysis by relaxing the assumption such as making task periods harmonic, restricting the scheduling points to a subset, obtain guess values, and avoiding testing system feasibly at unnecessary points. However, till date, the complexity of the time demand analysis still remains pseudo-polynomial. In this work, we propose a higher initial value for testing the feasibility of a lower priority task based on the feasibility analysis of immediate higher priority task. The proposed technique shows improvement over closely related counterparts. Experimental results are aligned with theoretical formulations presented in this paper.