Scheduling algorithm for hybrid sets of tasks based on (m,k)-Firm
Shen Song · Jisuanji gongcheng yu sheji · 2008
The problem of scheduling hybrid sets of tasks is discussed,consisting of firm period tasks and firm aperiodic tasks.The al-gorithm proposed tries to improve the schedule ability of aperiodic tasks,while meet to the(m,k)-firm constraint of period tasks.Meanwhile,the algorithm improves the quality of service(QoS) of the system by properly using the idle time in the system.A method of schedule ability test for aperiodic tasks is provided,and a method is given,which combines static scheduling and dynamic scheduling,to schedule period tasks and aperiodic tasks.Simulation results show that the algorithm proposed receives good performance.