A Mixed Scheduling Algorithm about Hard Periodic and Soft Aperiodic Real-Time Tasks on Heterogeneous Multiprocessor

This paper studies the problem about scheduling composition of periodic real-time tasks and aperiodic soft real-time tasks in heterogeneous multiprocessor environment. It analyzes the response time of each task in periodic real-time task set and the influence factor about the response time of aperiodic soft real-time task. We use a new mixed scheduling algorithm--UEDF and Task-Centric with Slack Defragmentation algorithm (TCSD) to schedule hybrid task set which consist of the periodic real-time tasks and aperiodic soft real-time tasks. It can improve the timeliness of aperiodic soft real-time tasks response, so the ratio of aperiodic tasks to meet soft deadline will increase.

[1]  John P. Lehoczky,et al.  An optimal algorithm for scheduling soft-aperiodic tasks in fixed-priority preemptive systems , 1992, [1992] Proceedings Real-Time Systems Symposium.

[2]  Geoffrey Nelissen,et al.  U-EDF: An Unfair But Optimal Multiprocessor Scheduling Algorithm for Sporadic Tasks , 2012, 2012 24th Euromicro Conference on Real-Time Systems.

[3]  José Rufino,et al.  Response Time Analysis of Asynchronous Periodic and Sporadic Tasks Sheduled by a Fixed Priority Preemptive Algorithm , 2008, 2008 Euromicro Conference on Real-Time Systems.

[4]  Yves Sorel,et al.  Schedulability analysis for a combination of non-preemptive strict periodic tasks and preemptive sporadic tasks , 2012, Proceedings of 2012 IEEE 17th International Conference on Emerging Technologies & Factory Automation (ETFA 2012).

[5]  Parameswaran Ramanathan,et al.  Combining Hard Periodic and Soft Aperiodic Real-Time Task Scheduling on Heterogeneous Compute Resources , 2011, 2011 International Conference on Parallel Processing.