Computational models are considered for real-time software applications with compound tasks. The opportunity of feasibility analysis of such applications is represented.
A brief survey of key results is presented on the feasibility analysis of real–time applications that are implemented by multicore processors with various scheduling methods. A method for estimation of task response time is suggested for scheduling with static task priorities. Number of planning points and number of context switches are estimated for quantum– based and non–quantum scheduling methods.
1 - 2 of 2 items